15033 search results - page 350 / 3007 » Complexity Theory and Algorithms |
223
click to vote
MOBICOM
2003
ACM
16 years 9 days ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
203
click to vote
DAM
1999
15 years 6 months ago
1999
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
198
click to vote
SMA
2003
ACM
16 years 9 days ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
216
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
211
click to vote
STOC
2005
ACM
16 years 18 days 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...