Sciweavers

1434 search results - page 85 / 287
» Graph Searching with Advice
Sort
View
145
Voted
TCS
2012
13 years 11 months ago
Improved simulation of nondeterministic Turing machines
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...
Subrahmanyam Kalyanasundaram, Richard J. Lipton, K...
128
Voted
WWW
2007
ACM
16 years 4 months ago
Anchor-based proximity measures
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...
Amruta Joshi, Ravi Kumar, Benjamin Reed, Andrew To...
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
15 years 9 months ago
Regrasp Planning of Four-Fingered Hand for Parallel Grasp of a Polygonal Object
— 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 ...
Thanathorn Phoka, Peam Pipattanasomporn, Nattee Ni...
97
Voted
AIPS
2000
15 years 4 months ago
Planning with Reduced Operator Sets
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...
Patrik Haslum, Peter Jonsson
187
Voted
CIKM
2009
Springer
15 years 8 months ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009