119 search results - page 17 / 24 » Linear-Time Algorithms for Parametric Minimum Spanning Tree ... |
129
click to vote
FOCS
1992
IEEE
15 years 7 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
152
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
160
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
152
click to vote
CCCG
2003
15 years 4 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
145
click to vote
STACS
2001
Springer
15 years 7 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...