242 search results - page 45 / 49 » Approximation Algorithms for Multi-Criteria Traveling Salesm... |
ESA
2004
Springer
15 years 3 months 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 ...
IJRR
2007
14 years 9 months ago
2007
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
CRV
2007
IEEE
15 years 1 months ago
2007
IEEE
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
ASPDAC
2000
ACM
15 years 1 months ago
2000
ACM
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
ARCS
2006
Springer
15 years 1 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...