54 search results - page 4 / 11 » Local-Search Techniques for Boolean Combinations of Pseudo-B... |
ECAIW
2000
Springer
13 years 11 months ago
2000
Springer
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
FROCOS
2011
Springer
12 years 7 months ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
BMCBI
2010
13 years 7 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
FLAIRS
2004
13 years 8 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...