5580 search results - page 208 / 1116 » Randomized priority algorithms |
162
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
114
click to vote
NDJFL
2010
14 years 9 months ago
2010
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
115
click to vote
CORR
2010
Springer
15 years 2 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...
157
Voted
ICALP
1991
Springer
15 years 5 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
108
click to vote
AI
1999
Springer
15 years 2 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...