66 search results - page 4 / 14 » Optimal oblivious routing in polynomial time |
138
click to vote
CNSR
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper presents a data routing protocol for a non-mobile, locationaware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environm...
128
click to vote
WAOA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
108
click to vote
QOSIP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
JUCS
2010
14 years 10 months ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
111
click to vote
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...