920 search results - page 40 / 184 » Generating Satisfiable Problem Instances |
IFIP
2001
Springer
14 years 2 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
GLVLSI
2002
IEEE
14 years 3 months ago
2002
IEEE
The paper presents a satisfiability-based method for solving the board-level multiterminal net routing problem in Clos-Folded FPGA based logic emulation systems. The approach tran...
COR
2006
13 years 10 months ago
2006
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...
CPAIOR
2010
Springer
13 years 8 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...