Sciweavers

1300 search results - page 72 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
103
Voted
CP
2005
Springer
15 years 3 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
CPAIOR
2006
Springer
15 years 2 months 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
98
Voted
EDBT
2012
ACM
271views Database» more  EDBT 2012»
13 years 19 days ago
Towards a decentralised hierarchical architecture for smart grids
We present a hierarchical distributed communication and control architecture for Smart Grids. The proposed topology consists of multiple layers to allow for robust and flexible d...
Daniel Rech, Andreas Harth
81
Voted
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
15 years 3 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...
75
Voted
CPAIOR
2004
Springer
15 years 3 months ago
Super Solutions in Constraint Programming
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh