5244 search results - page 134 / 1049 » Structural Complexity of AvgBPP |
122
click to vote
AIPS
2009
15 years 5 months ago
2009
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
111
click to vote
JCST
2006
15 years 4 months ago
2006
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
131
click to vote
PAMI
2006
15 years 4 months ago
2006
The goal of this paper is to provide a "self-adaptive" system for real-time range acquisition. Reconstructions are based on a single frame structured light illumination. ...
161
click to vote
TALG
2008
15 years 4 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
122
click to vote
AI
2004
Springer
15 years 4 months ago
2004
Springer
al Abstraction Luca Chittaro and Roberto Ranon Department of Mathematics and Computer Science, University of Udine, via delle Scienze 206, 33100 Udine, Italy ion has been advocat...