5153 search results - page 165 / 1031 » Introduction to Randomized Algorithms |
124
click to vote
AIMSA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
134
Voted
SODA
2000
ACM
15 years 4 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
138
Voted
ML
2006
ACM
15 years 2 months ago
2006
ACM
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
167
click to vote
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...
117
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 ...