Sciweavers

285 search results - page 24 / 57
» The complexity of soft constraint satisfaction
Sort
View
ECAL
2005
Springer
15 years 5 months ago
Evolutionary Transitions as a Metaphor for Evolutionary Optimisation
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert
AIPS
2009
15 years 28 days ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
AAAI
1994
15 years 1 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
SAT
2007
Springer
121views Hardware» more  SAT 2007»
15 years 6 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
JAIR
2008
120views more  JAIR 2008»
14 years 11 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras