Sciweavers

3678 search results - page 110 / 736
» On the Stable Paths Problem
Sort
View
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
15 years 27 days ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
CEC
2010
IEEE
14 years 4 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...
94
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
CISS
2008
IEEE
15 years 7 months ago
Optimal path planning for mobile backbone networks
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
Anand Srinivas, Eytan Modiano
DBSEC
2007
112views Database» more  DBSEC 2007»
15 years 2 months ago
Reliable Delivery of Event Data from Sensors to Actuators in Pervasive Computing Environments
Abstract. The event-condition-action (ECA) paradigm holds enormous potential in pervasive computing environments. However, the problem of reliable delivery of event data, generated...
Sudip Chakraborty, Nayot Poolsappasit, Indrajit Ra...