5153 search results - page 82 / 1031 » Introduction to Randomized Algorithms |
84
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
110
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
121
click to vote
AAIM
2008
Springer
15 years 4 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
104
click to vote
SODA
1997
ACM
15 years 3 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
138
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...