Semi-independent partitioning: A method for bounding the solution to COP's

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

Volumn 2833, Issue , 2003, Pages 894-898

  Larkin, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; OPTIMIZATION;

CONSTRAINT OPTIMIZATION PROBLEMS; INDEPENDENT PARTITIONING;

COMPUTER PROGRAMMING;

EID: 35248856856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_74     Document Type: Article

References (8)

1. Rina Dechter. Mini-buckets: A general scheme for generating approximations in automated reasoning. In IJCAI, 1997.
2. Rina Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, October 1999.
3. Rina Dechter, Kalev Kask, and Javier Larrosa. A general scheme for multiple lower bound computation in constraint optimization. In Proc. of the Conf. on Principles and Practice of Constraint Programming, 2001.
4. Rina Dechter and Irina Rish. A scheme for approximating probabilistic inference. In Proc. of the Conf. on Uncertainty in Artificial Intelligence, 1997.
5. E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21-70, 1992. Unobtained.
6. Kalev Kask and Rina Dechter. A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence, 129:91-131, 2001.
7. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 107:149-163, 1999.
8. Javier Larrosa and Pedro Meseguer. Partition-based lower bound for Max-CSP. In Principles and Practice of Constraint Programming, pages 305-315, 1999.