100 search results - page 15 / 20 » sat 2005 |
CP
2005
Springer
14 years 7 days ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
GECCO
2005
Springer
14 years 7 days ago
2005
Springer
An analysis for the phase transition in a random NK landscape model is given. For the fixed ratio model, NK(n, k, z), Gao and Culberson [17] showed that a random instance generat...
DATE
2005
IEEE
14 years 10 days ago
2005
IEEE
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
CHARME
2005
Springer
14 years 7 days ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
TACAS
2005
Springer
14 years 5 days ago
2005
Springer
SAT-based Predicate Abstraction for ANSI-C Edmund Clarke1 Daniel Kroening2 Natasha Sharygina1,3 Karen Yorav4 1 Carnegie Mellon University, School of Computer Science 2 ETH Zuerich,...