Sciweavers

658 search results - page 28 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
FLAIRS
2008
14 years 10 months ago
Feeder Setup Optimization in SMT Assembly
This paper describes an algorithm developed as a decision support system for SMT line operators and its purpose is to suggest changes in an existing feeder setup in order to impro...
Jan Kelbel, Zdenek Hanzálek
FLAIRS
2003
14 years 11 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
PRICAI
2004
Springer
15 years 3 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
74
Voted
JSCIC
2008
62views more  JSCIC 2008»
14 years 9 months ago
Robustness of a Spline Element Method with Constraints
The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...
Gerard Awanou
94
Voted
CP
2004
Springer
15 years 3 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate