Sciweavers

221 search results - page 12 / 45
» Duality in Optimization and Constraint Satisfaction
Sort
View
AMAI
1999
Springer
13 years 7 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
13 years 2 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 7 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
FLAIRS
2004
13 years 9 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson