193 search results - page 32 / 39 » A Lower Bound for the Shortest Path Problem |
113
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
100
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
95
Voted
STACS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
86
Voted
RAS
2007
14 years 11 months ago
2007
In free-floating mode, space manipulator systems have their actuators turned off, and exhibit nonholonomic behavior due to angular momentum conservation. The system is underactua...
104
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...