1016 search results - page 46 / 204 » Optimized algorithms for multi-agent routing |
APIN
2006
14 years 9 months ago
2006
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...
ICNP
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— In many energy-rechargeable wireless sensor networks, sensor nodes must both sense data from the environment, and cooperatively forward sensed data to data sinks. Both ...
INFOCOM
1997
IEEE
15 years 1 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
CN
2002
14 years 9 months ago
2002
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
104
click to vote
SIGMETRICS
2011
ACM
14 years 16 days ago
2011
ACM
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...