1197 search results - page 13 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
CAD
2010
Springer
13 years 8 months ago
2010
Springer
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...