Sciweavers

109 search results - page 16 / 22
» Variable symmetry breaking in numerical constraint problems
Sort
View
AIPS
2009
14 years 11 months 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
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
15 years 3 months ago
A genetic algorithm encoding for a class of cardinality constraints
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
Helio J. C. Barbosa, Afonso C. C. Lemonge
AI
2005
Springer
14 years 9 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
INFORMS
2010
100views more  INFORMS 2010»
14 years 7 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
MP
2008
99views more  MP 2008»
14 years 9 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph