BIROn - Birkbeck Institutional Research Online

    A CSP search algorithm with reduced branching factor

    Razgon, Igor and Meisels, A. (2005) A CSP search algorithm with reduced branching factor. In: Hnich, B. and Carlsson, M. and Fages, F. and Rossi, F. (eds.) CSCLP 2005: Recent Advances in Constraints. Lecture Notes in Computer Science 3978. Springer, pp. 59-72. ISBN 9783540342151.

    Full text not available from this repository.

    Abstract

    This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for construction of ”theoretical” constraint solvers because it decreases twice the base of the exponent of the upper bound of the search algorithm. We present a solver based on the strategy. The pruning mechanism of the algorithm resembles Forward Checking (FC), therefore we term it 2FC. According to our experimental evaluation, 2FC outperforms FC on graph coloring problems and on non-dense instances of randomly generated CSPs.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 11 Oct 2021 11:59
    Last Modified: 11 Oct 2021 11:59
    URI: https://eprints.bbk.ac.uk/id/eprint/46243

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    18Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item