Back to Results
First PageMeta 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


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

Document Date: 2010-11-22 06:22:32


Open Document

File Size: 104,04 KB

Share Result on Facebook

/

Facility

Carnegie-Mellon University / Uppsala University / University of Edinburgh / University College Cork / /

IndustryTerm

repair solutions / repair solution / partial repair solution / fault tolerant solutions / symmetric solutions / certain search algorithms / given solution / search tree / dynamic constraint networks / partial repair solutions / search space / search algorithm / Search effort / bound algorithm / /

Organization

CSP P / University of Edinburgh / Department of Information Science / Carnegie-Mellon University / Cork Constraint Computation Centre / Uppsala University / Science Foundation Ireland / /

Person

Brahim Hnich / Toby Walsh / Rx / Emmanuel Hebrard / /

/

Product

super solution / /

Technology

super Branch&Bound algorithm / AC algorithm / search algorithm / well known Maintaining Arc Consistency algorithm / existing CSP algorithm / repair-MAC algorithm / certain search algorithms / /

URL

http /

SocialTag