3678 search results - page 558 / 736 » On the Stable Paths Problem |
164
click to vote
HPDC
2005
IEEE
15 years 10 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
139
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
134
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
134
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
134
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...