Sciweavers

1016 search results - page 85 / 204
» Optimized algorithms for multi-agent routing
Sort
View
QOSIP
2005
Springer
15 years 3 months ago
Unicast and Multicast QoS Routing with Multiple Constraints
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...
Dan Wang, Funda Ergün, Zhan Xu
INFOCOM
2009
IEEE
15 years 4 months ago
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
Abstract—Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop ...
Lei Ying, Sanjay Shakkottai, Aneesh Reddy
MOBIHOC
2006
ACM
15 years 9 months ago
Message ferry route design for sparse ad hoc networks with mobile nodes
Message ferrying is a networking paradigm where a special node, called a message ferry, facilitates the connectivity in a mobile ad hoc network where the nodes are sparsely deploy...
Muhammad Mukarram Bin Tariq, Mostafa H. Ammar, Ell...
MATES
2010
Springer
14 years 8 months ago
Context-Aware Route Planning
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
Adriaan ter Mors, Cees Witteveen, Jonne Zutt, Fern...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang