<--- Back to Details
First PageDocument Content
Constraint programming / Operations research / Constraint satisfaction problem / Local consistency / Mathematical optimization / Heuristic / Integer programming / Constraint satisfaction / Search algorithm / Local search / Look-ahead / Decomposition method
Date: 2008-12-16 11:04:51
Constraint programming
Operations research
Constraint satisfaction problem
Local consistency
Mathematical optimization
Heuristic
Integer programming
Constraint satisfaction
Search algorithm
Local search
Look-ahead
Decomposition method

Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems Thanasis Balafoutis1 and Kostas Stergiou1 Department of Information & Communication Systems Engineering University of th

Add to Reading List

Source URL: tmancini.di.uniroma1.it

Download Document from Source Website

File Size: 203,57 KB

Share Document on Facebook

Similar Documents

Guidance & Model Language for Amending a Shoreland Ordinance for Consistency with Minnesota’s Buffer Law – For Permitted Agricultural Uses If a local government’s shoreland ordinance currently requires a 50-foot or

Guidance & Model Language for Amending a Shoreland Ordinance for Consistency with Minnesota’s Buffer Law – For Permitted Agricultural Uses If a local government’s shoreland ordinance currently requires a 50-foot or

DocID: 1uj0L - View Document

Important new laws applying to Local Council elections and Local Government Councillors commenced 1 JulyThe new laws are to promote integrity in the Local Government electoral process, and have consistency with Lo

Important new laws applying to Local Council elections and Local Government Councillors commenced 1 JulyThe new laws are to promote integrity in the Local Government electoral process, and have consistency with Lo

DocID: 1sa2e - View Document

Reasoning about XML Update Constraints∗ Bogdan Cautis Serge Abiteboul  INRIA Futurs & U. Paris Sud

Reasoning about XML Update Constraints∗ Bogdan Cautis Serge Abiteboul INRIA Futurs & U. Paris Sud

DocID: 1rjFm - View Document

Rounding Guarantees for Message-Passing MAP Inference with Logical Dependencies I  S

Rounding Guarantees for Message-Passing MAP Inference with Logical Dependencies I S

DocID: 1r1mx - View Document

Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees Stephen H. Bach University of Maryland

Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees Stephen H. Bach University of Maryland

DocID: 1r1cx - View Document