1986 search results - page 34 / 398 » constraints 2006 |
FAC
2010
13 years 6 months ago
2010
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
HEURISTICS
2002
13 years 7 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
JLP
2000
13 years 7 months ago
2000
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
HEURISTICS
2006
13 years 7 months ago
2006
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
CCCG
2006
13 years 9 months ago
2006
Geometric constraints solving often relies on graphbased methods to decompose systems of geometric constraints. These methods have intrinsic and unavoidable limitations which are ...