Sciweavers

12334 search results - page 2463 / 2467
» The Use of C
Sort
View
DRUMS
1998
Springer
14 years 2 months ago
Handling uncertainty in control of autonomous robots
Autonomous robots need the ability to move purposefully and without human intervention in real-world environments that have not been speci cally engineered for them. These environm...
Alessandro Saffiotti
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 10 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
ICALP
2009
Springer
14 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 10 months ago
Aurora: A Data Stream Management System
The Aurora system [1] is an experimental data stream management system with a fully functional prototype. It includes both a graphical development environment, and a runtime syste...
Daniel J. Abadi, Donald Carney, Ugur Çetint...
PODC
2009
ACM
14 years 7 months ago
The wireless synchronization problem
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Fabi...
« Prev « First page 2463 / 2467 Last » Next »