Sciweavers

2109 search results - page 120 / 422
» Solving Necklace Constraint Problems
Sort
View
165
Voted
IJCAI
2003
15 years 6 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
B
2007
Springer
15 years 11 months ago
Time Constraint Patterns for Event B Development
Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the cu...
Dominique Cansell, Dominique Méry, Joris Re...
174
Voted
TABLEAUX
1995
Springer
15 years 8 months ago
Constraint Model Elimination and a PTTP-Implementation
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
Peter Baumgartner, Frieder Stolzenburg
WLP
2005
Springer
15 years 10 months ago
Meta-S - Combining Solver Cooperation and Programming Languages
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
Stephan Frank, Petra Hofstedt, Dirk Reckmann
CPAIOR
2011
Springer
14 years 8 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan