Sciweavers

540 search results - page 3 / 108
» Competitive Routing over Time
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
13 years 10 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
SODA
1996
ACM
157views Algorithms» more  SODA 1996»
13 years 6 months ago
Routing and Admission Control in General Topology Networks with Poisson Arrivals
Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
Anil Kamath, Omri Palmon, Serge A. Plotkin
EUROPAR
2006
Springer
13 years 9 months ago
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
13 years 12 months ago
Multi-robot routing with linear decreasing rewards over time
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
Ali Ekici, Pinar Keskinocak, Sven Koenig
WWIC
2010
Springer
202views Communications» more  WWIC 2010»
13 years 9 months ago
SHORT: A Static-Hybrid Approach for Routing Real Time Applications over Multichannel, Multihop Wireless Networks
Many of the existing multichannel wireless network implementations rely on channel switching capability of the wireless radios to ensure network connectivity. However, due to both ...
Vijay Raman, Nitin H. Vaidya