1578 search results - page 82 / 316 » Algorithmic randomness of continuous functions |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
172
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
WAW
2009
Springer
15 years 4 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...