3874 search results - page 524 / 775 » Approximation Algorithms for k-hurdle Problems |
163
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
123
click to vote
PIMRC
2008
IEEE
15 years 11 months ago
2008
IEEE
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
120
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
133
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
146
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...