Sciweavers

706 search results - page 36 / 142
» Super Solutions in Constraint Programming
Sort
View
CORR
2007
Springer
68views Education» more  CORR 2007»
14 years 11 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
ICTAI
2008
IEEE
15 years 6 months ago
Probabilistic Continuous Constraint Satisfaction Problems
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
Elsa Carvalho, Jorge Cruz, Pedro Barahona
ECML
2005
Springer
15 years 5 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
SARA
2007
Springer
15 years 5 months ago
Reformulating Constraint Satisfaction Problems to Improve Scalability
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
AMAST
2004
Springer
15 years 5 months ago
On Guard: Producing Run-Time Checks from Integrity Constraints
Abstract. Software applications are inevitably concerned with data integrity, whether the data is stored in a database, files, or program memory. An integrity guard is code execut...
Michael Benedikt, Glenn Bruns