| slovo | definícia |
ravelling
(encz) | ravelling, |
Ravelling
(gcide) | Ravel \Rav"el\ (r[a^]v"'l), v. t. [imp. & p. p. Raveled (-'ld)
or Ravelled; p. pr. & vb. n. Raveling or Ravelling.]
[OD. ravelen, D. rafelen, akin to LG. rebeln, rebbeln,
reffeln.]
1. To separate or undo the texture of; to unravel; to take
apart; to untwist; to unweave or unknit; -- often followed
by out; as, to ravel a twist; to ravel out a stocking.
[1913 Webster]
Sleep, that knits up the raveled sleave of care.
--Shak.
[1913 Webster]
2. To undo the intricacies of; to disentangle.
[1913 Webster]
3. To pull apart, as the threads of a texture, and let them
fall into a tangled mass; hence, to entangle; to make
intricate; to involve.
[1913 Webster]
What glory's due to him that could divide
Such raveled interests? has the knot untied?
--Waller.
[1913 Webster]
The faith of very many men seems a duty so weak and
indifferent, is so often untwisted by violence, or
raveled and entangled in weak discourses! --Jer.
Taylor.
[1913 Webster] |
ravelling
(wn) | ravelling
n 1: a bit of fiber that has become separated from woven fabric
[syn: raveling, ravelling] |
| | podobné slovo | definícia |
travelling
(mass) | travelling
- cestovný, cestovný, cestovanie |
ravelling
(encz) | ravelling, |
travelling
(encz) | travelling,cestování travelling,cestovní Zdeněk Brožtravelling,pojízdný adj: Zdeněk Brož |
travelling expenses
(encz) | travelling expenses,cestovné Zdeněk Brož |
travelling money
(encz) | travelling money,cestovné Zdeněk Brož |
travelling salesman
(encz) | travelling salesman, n: |
travelling wave
(encz) | travelling wave,postupná vlna Z.Franče |
unravelling
(encz) | unravelling, |
travelling wave tube
(czen) | Travelling Wave Tube,TWT[zkr.] [voj.] Zdeněk Brož a automatický překlad |
Gravelling
(gcide) | Graveling \Grav"el*ing\, or Gravelling \Grav"el*ling\, n.
1. The act of covering with gravel.
[1913 Webster]
2. A layer or coating of gravel (on a path, etc.). GravelingGraveling \Grav"el*ing\, or Gravelling \Grav"el*ling\, n.
(Zool.)
A salmon one or two years old, before it has gone to sea.
[1913 Webster]Gravel \Grav"el\, v. t. [imp. & p. p. Graveledor Gravelled;
p. pr. & vb. n. Graveling or Gravelling.]
[1913 Webster]
1. To cover with gravel; as, to gravel a walk.
[1913 Webster]
2. To run (as a ship) upon the gravel or beach; to run
aground; to cause to stick fast in gravel or sand.
[1913 Webster]
When we were fallen into a place between two seas,
they graveled the ship. --Acts xxvii.
41 (Rhemish
version).
[1913 Webster]
Willam the Conqueror . . . chanced as his arrival to
be graveled; and one of his feet stuck so fast in
the sand that he fell to the ground. --Camden.
[1913 Webster]
3. To check or stop; to embarrass; to perplex. [Colloq.]
[1913 Webster]
When you were graveled for lack of matter. --Shak.
[1913 Webster]
The physician was so graveled and amazed withal,
that he had not a word more to say. --Sir T.
North.
[1913 Webster]
4. To hurt or lame (a horse) by gravel lodged between the
shoe and foot.
[1913 Webster] |
Travelling
(gcide) | Travel \Trav"el\, v. i. [imp. & p. p. Traveledor Travelled;
p. pr. & vb. n. Traveling or Travelling.] [Properly, to
labor, and the same word as travail.]
1. To labor; to travail. [Obsoles.] --Hooker.
[1913 Webster]
2. To go or march on foot; to walk; as, to travel over the
city, or through the streets.
[1913 Webster]
3. To pass by riding, or in any manner, to a distant place,
or to many places; to journey; as, a man travels for his
health; he is traveling in California.
[1913 Webster]
4. To pass; to go; to move.
[1913 Webster]
Time travels in divers paces with divers persons.
--Shak.
[1913 Webster] |
ravelling
(wn) | ravelling
n 1: a bit of fiber that has become separated from woven fabric
[syn: raveling, ravelling] |
travelling
(wn) | travelling
n 1: the act of going from one place to another; "he enjoyed
selling but he hated the travel" [syn: travel,
traveling, travelling] |
travelling bag
(wn) | travelling bag
n 1: a portable rectangular container for carrying clothes; "he
carried his small bag onto the plane with him" [syn: bag,
traveling bag, travelling bag, grip, suitcase] |
travelling salesman
(wn) | travelling salesman
n 1: a salesman who travels to call on customers [syn:
traveling salesman, travelling salesman, {commercial
traveler}, commercial traveller, roadman, bagman] |
travelling wave
(wn) | travelling wave
n 1: a wave in which the medium moves in the direction of
propagation of the wave [syn: traveling wave, {travelling
wave}] |
travelling salesman
(foldoc) | travelling salesman problem
travelling salesman
TSP
(TSP or "shortest path", US:
"traveling") Given a set of towns and the distances between
them, determine the shortest path starting from a given town,
passing through all the other towns and returning to the first
town.
This is a famous problem with a variety of solutions of
varying complexity and efficiency. The simplest solution (the
brute force approach) generates all possible routes and
takes the shortest. This becomes impractical as the number of
towns, N, increases since the number of possible routes is
!(N-1). A more intelligent algorithm (similar to {iterative
deepening}) considers the shortest path to each town which can
be reached in one hop, then two hops, and so on until all
towns have been visited. At each stage the algorithm
maintains a "frontier" of reachable towns along with the
shortest route to each. It then expands this frontier by one
hop each time.
{Pablo Moscato's TSP bibliography
(http://densis.fee.unicamp.br/~moscato/TSPBIB_home.html)}.
{Fractals and the TSP
(http://ing.unlp.edu.ar/cetad/mos/FRACTAL_TSP_home.html)}.
(1998-03-24)
|
travelling salesman problem
(foldoc) | travelling salesman problem
travelling salesman
TSP
(TSP or "shortest path", US:
"traveling") Given a set of towns and the distances between
them, determine the shortest path starting from a given town,
passing through all the other towns and returning to the first
town.
This is a famous problem with a variety of solutions of
varying complexity and efficiency. The simplest solution (the
brute force approach) generates all possible routes and
takes the shortest. This becomes impractical as the number of
towns, N, increases since the number of possible routes is
!(N-1). A more intelligent algorithm (similar to {iterative
deepening}) considers the shortest path to each town which can
be reached in one hop, then two hops, and so on until all
towns have been visited. At each stage the algorithm
maintains a "frontier" of reachable towns along with the
shortest route to each. It then expands this frontier by one
hop each time.
{Pablo Moscato's TSP bibliography
(http://densis.fee.unicamp.br/~moscato/TSPBIB_home.html)}.
{Fractals and the TSP
(http://ing.unlp.edu.ar/cetad/mos/FRACTAL_TSP_home.html)}.
(1998-03-24)
|
|