3678 search results - page 254 / 736 » On the Stable Paths Problem |
139
click to vote
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
As the network technology has been developed, the Next Generation Internet (NGI) such as Internet2, KOREN, KREONET2 and etc has been deployed to support bandwidth of Giga bps. And,...
209
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
151
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
159
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
172
click to vote
INFOCOM
2007
IEEE
16 years 16 days ago
2007
IEEE
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...