2343 search results - page 151 / 469 » The Locomotive Routing Problem |
147
Voted
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
148
Voted
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
We have identified a fundamental operator in wireless networks that we named the local leader election in which the goal is to select a node in a spatially close neighborhood. We ...
200
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
A common objective of Internet traffic engineering is to minimize the maximal link utilization in a network in order to accommodate more traffic and reduce the chance of congestion...
160
click to vote
EOR
2011
15 years 1 months ago
2011
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporal traffic co...
186
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...