Sciweavers

4255 search results - page 783 / 851
» Cover
Sort
View
AIPS
2010
15 years 2 months ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
NSDI
2008
15 years 2 months ago
Studying Black Holes in the Internet with Hubble
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
Ethan Katz-Bassett, Harsha V. Madhyastha, John P. ...
USS
2008
15 years 2 months ago
CloudAV: N-Version Antivirus in the Network Cloud
Antivirus software is one of the most widely used tools for detecting and stopping malicious and unwanted files. However, the long term effectiveness of traditional hostbased anti...
Jon Oberheide, Evan Cooke, Farnam Jahanian
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 1 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ATAL
2008
Springer
15 years 1 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla