Sciweavers

235 search results - page 22 / 47
» An efficient consistency algorithm for the Temporal Constrai...
Sort
View
COMPULOG
1999
Springer
13 years 12 months 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
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
CORR
2004
Springer
136views Education» more  CORR 2004»
13 years 7 months ago
On Global Warming (Softening Global Constraints)
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
NOMS
2000
IEEE
141views Communications» more  NOMS 2000»
13 years 12 months ago
IconoNET: a tool for automated bandwidth allocation planning
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
Christian Frei, Boi Faltings, George Melissargos, ...
JAIR
2011
124views more  JAIR 2011»
13 years 2 months ago
Second-Order Consistencies
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
Christophe Lecoutre, Stéphane Cardon, Julie...