1016 search results - page 68 / 204 » Optimized algorithms for multi-agent routing |
NETWORKS
2008
14 years 9 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
CNSR
2007
IEEE
14 years 11 months ago
2007
IEEE
Wireless sensor networks have mainly been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In orde...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Routing to mobile nodes in a wireless network is conventionally performed by associating a static IP address (or a geographic location) to each node, and routing to that address...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...