245 search results - page 4 / 49 » Locating phase transitions in computationally hard problems |
CP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
IJAMCIGI
2010
14 years 6 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
CP
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
114
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
- Vulnerabilities related to weak passwords are a pressing global economic and security issue. We report a novel, simple, and effective approach to address the weak password probl...
121
click to vote
CSR
2007
Springer
15 years 5 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...