Journal ArticleDOI
Criticality and Parallelism in GSAT
TLDR
The existence of an optimum degree of parallelism ((τopt) for which the best performance, in terms of efficiency and number of iterations, and effectiveness is obtained is obtained.About:
This article is published in Electronic Notes in Discrete Mathematics.The article was published on 2001-06-01. It has received 12 citations till now. The article focuses on the topics: Degree of parallelism & Local search (constraint satisfaction).read more
Citations
More filters
Journal ArticleDOI
Dynamical Criticality: Overview and Open Questions
TL;DR: The criticality hypothesis as mentioned in this paper states that systems in a dynamical regime between order and disorder attain the highest level of computational capabilities and achieve an optimal trade-off between robustness and flexibility.
Journal ArticleDOI
An overview of parallel SAT solving
TL;DR: This paper presents an overview of parallel SAT solving, namely, different approaches and a variety of clause sharing strategies, and an evaluation of multicore SAT solvers is presented, showing the evolution of multicores over the last years.
Posted Content
Dynamical criticality: overview and open questions
TL;DR: The authors review the main contributions concerning dynamics and information processing at the edge of chaos, and illustrate the main achievements in the study of critical dynamics in biological systems.
A review of the literature on local search algorithms for MAX-SAT
TL;DR: The satisfiability problem in propositional logic (SAT) is the task to decide for a given propositional formula whether it has a model and is amongst the central problems in theoretical computer science.
Book ChapterDOI
Parallel Resolution of the Satisfiability Problem: A Survey
TL;DR: The intention is to review the work of this last decade on parallel resolution of SAT with DPLL solvers which are the most widely used complete ones.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Proceedings Article
A new method for solving hard satisfiability problems
TL;DR: A greedy local search procedure called GSAT is introduced for solving propositional satisfiability problems and its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.