980 search results - page 149 / 196 » Decentralized Constraint Satisfaction |
163
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
150
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
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...
133
click to vote
SAT
2007
Springer
15 years 10 months ago
2007
Springer
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 ...
137
Voted
VMCAI
2007
Springer
15 years 10 months ago
2007
Springer
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...
145
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
— 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...