3495 search results - page 53 / 699 » On the random satisfiable process |
FCS
2006
14 years 5 days ago
2006
-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The problem of guessing a random string is revisited and some prior results on guessing exponents are re-derived using the theory of large deviations. It is shown that if the seque...
STACS
2004
Springer
14 years 4 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—For a long time, signal processing applications, and most particularly detection and parameter estimation methods, have relied on the limiting behaviour of test statistics and e...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...