272 search results - page 45 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
WEA
2010
Springer
14 years 14 days ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
ESA
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...