1983 search results - page 136 / 397 » Competitive graph searches |
TCS
2012
12 years 3 months ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper proposes a necessary and sufficient condition for parallel grasps. We extend the use of this condition to the task of regrasp planning. In particular, we propose a ...
AIPS
2000
13 years 9 months ago
2000
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...
SISAP
2009
IEEE
14 years 2 months ago
2009
IEEE
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...