216 search results - page 41 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
AAAI
2008
13 years 10 months ago
2008
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
PRICAI
2004
Springer
14 years 1 months ago
2004
Springer
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for ...
SIROCCO
2010
13 years 9 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
PVM
1997
Springer
13 years 11 months ago
1997
Springer
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...