610 search results - page 112 / 122 » Using SAT in QBF |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
ICFEM
2004
Springer
14 years 1 months ago
2004
Springer
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...
CIAC
2003
Springer
14 years 27 days ago
2003
Springer
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...
GLVLSI
2010
IEEE
14 years 23 days ago
2010
IEEE
Researchers are looking for alternatives to overcome the upcoming limits of conventional hardware technologies. Reversible logic thereby established itself as a promising directio...
ECAI
2000
Springer
14 years 18 hour ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...