400 search results - page 5 / 80 » Hard Problem Generation for MKP |
CISSE
2009
Springer
13 years 11 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained. We show that the SAT problem for formulas in these cla...
AAAI
1997
13 years 8 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
RV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We address the problem of runtime monitoring for hard realtime programs—a domain in which correctness is critical yet has largely been overlooked in the runtime monitor...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...