2725 search results - page 105 / 545 » Constraint Solving for Interpolation |
119
Voted
ICAI
2003
15 years 2 months ago
2003
Many real-world search and optimization problems naturally involve constraint handling. Recently, quite a few heuristic methods were proposed to solve the nonlinear constrained op...
104
Voted
EAAI
2008
15 years 27 days ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
85
Voted
JAR
2008
15 years 24 days ago
2008
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
124
click to vote
ICAI
2010
14 years 10 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
126
click to vote
MATES
2009
Springer
15 years 7 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...