ResearchSpace

Branch and bound algorithms to solve semiring constraint satisfaction problems

Show simple item record

dc.contributor.author Leenen, L
dc.contributor.author Ghose, A
dc.date.accessioned 2009-02-19T12:39:40Z
dc.date.available 2009-02-19T12:39:40Z
dc.date.issued 2008-12
dc.identifier.citation Leenen, L and Ghose, A. 2008. Branch and bound algorithms to solve semiring constraint satisfaction problems. Tenth Pacific Rim International Conference on Artificial Intelligence (PRICAI-08), Hanoi, Vietnam, 15-19 December 2008, pp 6 en
dc.identifier.isbn 978-3-540-89196-3
dc.identifier.uri http://hdl.handle.net/10204/3040
dc.description This paper has also been published by Springer Verlag as a volume of LNAI series, number 5351 , pp 991-997. en
dc.description.abstract The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. Considerable research has been done in solving SCSPs, but limited work has been done in building general SCSP solvers. This paper is part of a series in which incremental changes are made to a branch and bound (BnB) algorithm for solving SCSPs. The authors present two variants of a BnB algorithm: a backjumping algorithm and a forward checking algorithm. These algorithms are based on the maximal constraints algorithms of Freuder and Wallace, and it is shown that they perform better than the BnB algorithm on some problem instances en
dc.language.iso en en
dc.publisher Pacific Rim International Conference on Artificial Intelligence (PRICAI-08) en
dc.subject SCSP en
dc.subject Semiring constraint satisfaction problems en
dc.subject Branch and bound (BnB) algorithm en
dc.subject Over-constrained problems en
dc.title Branch and bound algorithms to solve semiring constraint satisfaction problems en
dc.type Conference Presentation en
dc.identifier.apacitation Leenen, L., & Ghose, A. (2008). Branch and bound algorithms to solve semiring constraint satisfaction problems. Pacific Rim International Conference on Artificial Intelligence (PRICAI-08). http://hdl.handle.net/10204/3040 en_ZA
dc.identifier.chicagocitation Leenen, L, and A Ghose. "Branch and bound algorithms to solve semiring constraint satisfaction problems." (2008): http://hdl.handle.net/10204/3040 en_ZA
dc.identifier.vancouvercitation Leenen L, Ghose A, Branch and bound algorithms to solve semiring constraint satisfaction problems; Pacific Rim International Conference on Artificial Intelligence (PRICAI-08); 2008. http://hdl.handle.net/10204/3040 . en_ZA
dc.identifier.ris TY - Conference Presentation AU - Leenen, L AU - Ghose, A AB - The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. Considerable research has been done in solving SCSPs, but limited work has been done in building general SCSP solvers. This paper is part of a series in which incremental changes are made to a branch and bound (BnB) algorithm for solving SCSPs. The authors present two variants of a BnB algorithm: a backjumping algorithm and a forward checking algorithm. These algorithms are based on the maximal constraints algorithms of Freuder and Wallace, and it is shown that they perform better than the BnB algorithm on some problem instances DA - 2008-12 DB - ResearchSpace DP - CSIR KW - SCSP KW - Semiring constraint satisfaction problems KW - Branch and bound (BnB) algorithm KW - Over-constrained problems LK - https://researchspace.csir.co.za PY - 2008 SM - 978-3-540-89196-3 T1 - Branch and bound algorithms to solve semiring constraint satisfaction problems TI - Branch and bound algorithms to solve semiring constraint satisfaction problems UR - http://hdl.handle.net/10204/3040 ER - en_ZA


Files in this item

Thumbnail
Name: Leenen1_2008.pdf
Size: 169.8Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Show simple item record