Sciweavers

2109 search results - page 85 / 422
» Solving Necklace Constraint Problems
Sort
View
CP
2003
Springer
15 years 10 months ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
IJAIT
2008
99views more  IJAIT 2008»
15 years 4 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
135
Voted
SIAMDM
2008
90views more  SIAMDM 2008»
15 years 4 months ago
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
Andrei A. Krokhin, Benoit Larose
ICAI
2003
15 years 6 months ago
Exploiting the Marginal Profits of Constraints with Evolutionary Multi-Objective Optimization Techniques
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...
Zhenyu Yan, Wei Zhi, Lishan Kang
COR
2007
183views more  COR 2007»
15 years 4 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
Thierry Mautor, Edith Naudin