2735 search results - page 136 / 547 » Comparing notions of randomness |
SAT
2004
Springer
14 years 3 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...
ASYNC
1997
IEEE
14 years 2 months ago
1997
IEEE
This paper presents an in-depth case study in highperformance asynchronous adder design. A recent method, called “speculative completion”, is used. This method uses single-rai...
COCOA
2008
Springer
13 years 12 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
MJ
2006
13 years 10 months ago
2006
Surface relief formed by nanoimprinting and etching into a thermally grown SiO2 layer on Si was used to position the initial nuclei formed by chemically vapor deposited Si and Ge....
COMBINATORICA
2004
13 years 10 months ago
2004
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...