Opportunistic specialization in Russian doll search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2470, Issue , 2002, Pages 264-279

  Meseguer, Pedro ^a   Sánchez, Martí ^a   Verfaillie, Gérard ^b  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b ONERA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CURRENT DISTRIBUTION; HIGHER EFFICIENCY; LOWER BOUNDS; NATURAL EXTENSION; OVER-CONSTRAINED PROBLEM; REAL PROBLEMS; RUSSIAN DOLL; SUB-PROBLEMS;

PROBLEM SOLVING;

EID: 57649159660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. M. S. Affane and H. Bennaceur. A weighted arc consistency technique for Max- CSP. In Proc. of the 13th ECAI, 209–213, 1998.
2. S. Bistarelli, U. Montanari and F. Rossi. Constraint Solving over Semirings. In Proc. of the 14th IJCAI, 1995.
3. S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie and H. Fargier. Semiring-basedCS Ps andValued CSPs: Frameworks, Properties and Comparison. Constraints, 4:199–240, 1999.
4. B. Cabon, S. De Givry, L. Lobjois, T. Schiex and J. P. Warners. Radio Link Frequency Assignment Constraints, vol. 4, num. 1, 79–89, 1999.
5. R. Dechter. Mini-buckets: A general scheme for generating approximations in automatedreason ing. Artificial Intelligence, 113:41–85, 1999.
6. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41–85, 1999.
7. E.C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992
8. J. Larrosa. Boosting search with variable elimination. In Proc. of the 6th CP, 291–305, 2000.
9. J. Larrosa. Node and arc consistency in Weighted CSP. In Proc. of the 18th AAAI, 2002.
10. J. Larrosa and P. Meseguer. Exploiting the use of DAC in Max-CSP. In Proc. Of the 2th CP, 308–322, 1996
11. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 107:149–163, 1999.
12. P. Meseguer, M. Sanchez. Specializing russian doll search. In Proc. of the 7thCP, 464–478, 2001.
13. T. Schiex, H. Fargier and G. Verfaillie. ValuedCon straint Satisfaction Problems: harda nde asy problems. In Proc. of the 14th IJCAI, 631–637, 1995.
14. T. Schiex. Arc consistency for soft constraints In Proc. of the 6th CP, 411–424, 2000.
15. G. Verfaillie, M. Lemaˆitre, and T. Schiex. Russian doll search. In Proc. of the 13thAAAI, 181–187, 1996.
16. R. Wallace. Directedarc consistency preprocessing. In M. Meyer, editor, Selected papers from the ECAI-94 Workshop on Constraint Processing, number 923 in LNCS, 121–137. Springer, Berlin, 1995.