<--- Back to Details
First PageDocument Content
Computing / Constraint satisfaction problem / Constraint satisfaction / Local consistency / Backtracking / Optimization problem / Mathematical optimization / Min-conflicts algorithm / Linear programming relaxation / Constraint programming / Software engineering / Computer programming
Date: 2010-11-22 06:22:32
Computing
Constraint satisfaction problem
Constraint satisfaction
Local consistency
Backtracking
Optimization problem
Mathematical optimization
Min-conflicts algorithm
Linear programming relaxation
Constraint programming
Software engineering
Computer programming

Robust Solutions for Constraint Satisfaction and Optimization Emmanuel Hebrard and Brahim Hnich and Toby Walsh 12 Abstract. Super solutions are a mechanism to provide robustness to constraint programsThey are solu

Add to Reading List

Source URL: homepages.laas.fr

Download Document from Source Website

File Size: 104,04 KB

Share Document on Facebook

Similar Documents

in Knowledge Engineering Reviews, 2001  Synthesis of EÆcient Constraint Satisfaction Programs Stephen J. Westfold and Douglas R. Smith Kestrel Institute 3260 Hillview Avenue

in Knowledge Engineering Reviews, 2001 Synthesis of EÆcient Constraint Satisfaction Programs Stephen J. Westfold and Douglas R. Smith Kestrel Institute 3260 Hillview Avenue

DocID: 1xVgq - View Document

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems∗ Eli Ben-Sasson† Alessandro Chiesa†

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems∗ Eli Ben-Sasson† Alessandro Chiesa†

DocID: 1xTDp - View Document

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

DocID: 1uD4W - View Document

1  Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

DocID: 1ukgD - View Document

5  CONSTRAINT SATISFACTION PROBLEMS  In which we see how treating states as more than just little black boxes leads to the

5 CONSTRAINT SATISFACTION PROBLEMS In which we see how treating states as more than just little black boxes leads to the

DocID: 1uf9a - View Document