3678 search results - page 290 / 736 » On the Stable Paths Problem |
166
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
207
click to vote
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
The paper investigates the usefulness of multi-path routing to achieve lifetime improvements by load balancing and exploiting cross-layer information in wireless sensor networks. P...
145
click to vote
ICTAI
2005
IEEE
16 years 9 days ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
181
click to vote
CC
2004
Springer
16 years 3 days ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
187
click to vote
ANSS
2002
IEEE
15 years 11 months ago
2002
IEEE
In previous work we presented an algorithm for cloning parallel simulations that enables multiple simulated execution paths to be explored simultaneously. The method is targeted f...