| slovo | definícia |
travelling
(mass) | travelling
- cestovný, cestovný, cestovanie |
travelling
(encz) | travelling,cestování |
travelling
(encz) | travelling,cestovní Zdeněk Brož |
travelling
(encz) | travelling,pojízdný adj: Zdeněk Brož |
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] |
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] |
| | podobné slovo | definícia |
travelling
(mass) | travelling
- cestovný, cestovný, cestovanie |
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 |
travelling wave tube
(czen) | Travelling Wave Tube,TWT[zkr.] [voj.] Zdeněk Brož a automatický překlad |
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)
|
|