1376 search results - page 58 / 276 » Searching Trees: An Essay |
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
114
click to vote
ISMIS
2000
Springer
15 years 3 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
100
click to vote
COOPIS
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper addresses several problems associated with the specification of Web searches, and the retrieval, filtering, and rating of Web pages in order to improve the relevance, pr...
TSP
2010
14 years 6 months ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...