478 search results - page 21 / 96 » A simple expected running time analysis for randomized |
149
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
153
click to vote
ICCAD
2005
IEEE
16 years 2 months ago
2005
IEEE
Based on a timing yield model, a statistical static timing analysis technique is proposed. This technique preserves existing methodology by selecting a “device file setting” ...
172
click to vote
SPAA
2009
ACM
16 years 8 days ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
157
Voted
CCGRID
2008
IEEE
15 years 12 months ago
2008
IEEE
— Diffusion Tensor Imaging (DTI) provides insight into the white matter of the human brain, which is affected by Schizophrenia. By comparing a patient group to a control group, t...
158
click to vote
AIMSA
2008
Springer
15 years 12 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...