Sciweavers

46 search results - page 6 / 10
» Breaking All Value Symmetries in Surjection Problems
Sort
View
CDC
2009
IEEE
157views Control Systems» more  CDC 2009»
15 years 3 months ago
A PDE viewpoint on basic properties of coordination algorithms with symmetries
Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with res...
Alain Sarlette, Rodolphe Sepulchre
AAAI
2004
15 years 1 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong
92
Voted
ECAI
2004
Springer
15 years 5 months ago
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
CPAIOR
2010
Springer
15 years 4 months ago
The Increasing Nvalue Constraint
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca...
CONSTRAINTS
2011
14 years 6 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...