Sciweavers

104 search results - page 10 / 21
» A Domain Consistency Algorithm for the Stretch Constraint
Sort
View
CPAIOR
2006
Springer
14 years 7 days ago
Open Constraints in a Closed World
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
Willem Jan van Hoeve, Jean-Charles Régin
CEC
2005
IEEE
14 years 2 months ago
Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
Bart G. W. Craenen, A. E. Eiben
COMPULOG
1999
Springer
14 years 24 days ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
FROCOS
2000
Springer
14 years 3 days ago
Handling Differential Equations with Constraints for Decision Support
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
Jorge Cruz, Pedro Barahona
CP
1999
Springer
14 years 24 days ago
An Interval Constraint Approach to Handle Parametric Ordinary Differential Equations for Decision Support
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
Jorge Cruz, Pedro Barahona