551 search results - page 55 / 111 » Continuous Search in Constraint Programming |
ICALP
2003
Springer
14 years 28 days ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
AUTOMATICA
2007
13 years 7 months ago
2007
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...
CP
2008
Springer
13 years 8 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
AI
2010
Springer
13 years 7 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
CP
2011
Springer
12 years 7 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...