Sciweavers

218 search results - page 20 / 44
» Finite Trees as Ordinals
Sort
View
AMAI
2008
Springer
14 years 10 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka
AUSAI
2006
Springer
15 years 1 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
DKE
2006
139views more  DKE 2006»
14 years 10 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
CG
2006
Springer
14 years 10 months ago
Interruptible collision detection for deformable objects
This paper presents an approach to performing time-critical collision detection for deformable objects. The deformable objects are represented by dense meshes and their deformatio...
César Mendoza, Carol O'Sullivan