Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Trends in Constraint Programming Frdric BENHAMOU
 

Summary: Trends in Constraint Programming
Frédéric BENHAMOU
Narendra JUSSIEN
Barry O'SULLIVAN
November 24, 2006
2
Contents
FIRST PART. LOCAL SEARCH TECHNIQUES IN CONSTRAINT SATISFAC-
TION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
Chapter 1. Local search techniques in Constraint satisfaction . . . . . . . . 13
Yehuda NAVEH , Andrea ROLI
Chapter 2. Boosting SLS using Resolution . . . . . . . . . . . . . . . . . . . 15
ANBULAGAN, Duc Nghia PHAM, John SLANEY , Abdul SATTAR
2.1. The SLS Solvers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
2.2. The Preprocessors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
2.3. Empirical Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
2.3.1. Clause Weighting versus Random Walk . . . . . . . . . . . . . . . 18
2.3.2. Matching Preprocessors to Solver-Problem Pairs . . . . . . . . . . 18
2.3.3. Multiple Preprocessing and Preprocessor Ordering . . . . . . . . . 19
2.4. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20

  

Source: Anbulagan, A. - National ICT Australia & Computer Sciences Laboratory, Australian National University

 

Collections: Computer Technologies and Information Sciences