34 search results - page 3 / 7 » Resolution versus Search: Two Strategies for SAT |
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
This paper combines the idea of a hierarchical distributed genetic algorithm with different interagent partnering strategies. Cascading clusters of sub-populations are built from ...
CP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
INTERACT
2003
13 years 7 months ago
2003
: Using speech input to augment the remote control can be an alternative interaction technique for interactive television. However, little is known about how to design such a syste...
FLAIRS
2007
13 years 8 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...