2434 search results - page 106 / 487 » Algorithmic Randomness of Closed Sets |
127
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
116
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
194
click to vote
CVPR
2011
IEEE
14 years 12 months ago
2011
IEEE
This paper presents an algorithm for order reduction of
factors in High-Order Markov Random Fields (HOMRFs).
Standard techniques for transforming arbitrary high-order
factors in...
126
Voted
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
139
Voted
DGCI
2009
Springer
15 years 6 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...