1060 search results - page 95 / 212 » On the Discovery of Random Trees |
167
click to vote
ICRA
2007
IEEE
16 years 20 days 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...
164
click to vote
IJCAI
2007
15 years 7 months ago
2007
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
212
click to vote
COCO
2009
Springer
16 years 28 days ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
156
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
206
click to vote
ADC
2003
Springer
15 years 11 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...