Sciweavers

858 search results - page 134 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
SAT
2007
Springer
121views Hardware» more  SAT 2007»
14 years 1 months ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras
VMCAI
2007
Springer
14 years 1 months ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...
IJCNN
2006
IEEE
14 years 1 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang
KBSE
2006
IEEE
14 years 1 months ago
Modularity Analysis of Logical Design Models
Traditional design representations are inadequate for generalized reasoning about modularity in design and its technical and economic implications. We have developed an architectu...
Yuanfang Cai, Kevin J. Sullivan