Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"backtrack search"”.

  1. APPLICATION OF FUZZY LOGIC TO PARTIAL CONSTRAINT SATISFACTION PROBLEM

    Constraint-directed search techniques are an efficient approc1ch for solving constraint satisfaction problems (CSPs). These techniques usually use constraint propagation to simplify the original problem, and then employ intelligent backtracking to search for a solution, or all possible solutions, …

    nus Repository record for APPLICATION OF FUZZY LOGIC TO PARTIAL CONSTRAINT SATISFACTION PROBLEM (opens in a new tab) Download file for APPLICATION OF FUZZY LOGIC TO PARTIAL CONSTRAINT SATISFACTION PROBLEM (opens in a new tab)

  2. Augmenting Local Search for Satisfiability

    … to the satisfiability problem, focusing on local search methods. The research endeavours to better understand how and why some local search methods are effective. At the root of this understanding are a set of metrics that characterize the behaviour of local search methods. Based on this …

    waterloo Repository record for Augmenting Local Search for Satisfiability (opens in a new tab)

  3. Higher-Level Consistencies: Where, When, and How Much

    … consistency), conditioning (i.e., doing search), or, more commonly, by interleaving the two mechanisms. The most common consistency property enforced during search is Generalized Arc Consistency (GAC). In recent years, new algorithms that enforce consistency properties stronger than GAC …

    nebraska Repository record for Higher-Level Consistencies: Where, When, and How Much (opens in a new tab)

  4. Towards more efficient solution of conditional constraint satisfaction problems

    … literature of the class of conditional CSPs, a backtrack search algorithm tested on a handful of small problem examples, have been taken an important step further and aligned with efforts reported for standard and other special classes of CSPs.

    unh-thes Repository record for Towards more efficient solution of conditional constraint satisfaction problems (opens in a new tab)

  5. An algorithmic approach for multi-color Ramsey graphs

    … time algorithm to construct Ramsey graphs by searching and checking. Consequently, a method such as backtracking with good pruning techniques should be used. Algebraic methods were developed to enable such a backtrack search to be feasible when symmetry is assumed. With the algorithm developed …

    rit Repository record for An algorithmic approach for multi-color Ramsey graphs (opens in a new tab)

  6. An implementation of the DPLL algorithm

    … years, the Davis-Putnam-Logemann-Loveland (DPLL) backtrack-search algorithm has been immensely popular as a complete (it finds a solution if one exists; otherwise correctly says that no solution exists) and efficient procedure to solve the satisfiability problem. We have implemented an efficient …

    concordia Download PDF for An implementation of the DPLL algorithm (opens in a new tab)

  7. Algorithms for classification of combinatorial objects

    … – together with a summary surveying related research and emphasizing the underlying common concepts and techniques, such as backtrack search, isomorphism (viewed through group actions), symmetry, isomorph rejection, and computing isomorphism. From an algorithmic viewpoint the focus of the …

    aalto Repository record for Algorithms for classification of combinatorial objects (opens in a new tab)

  8. Constructing certain combinatorial structures by computational methods

    … to combinatorial problems are described. Tabu search on graphs with cyclic symmetry is used to obtain a lower bound for a Ramsey number, an orderly backtrack search with isomorph rejection is applied to a particular class of codes to classify certain designs and the whist tournaments with up to …

    aalto Repository record for Constructing certain combinatorial structures by computational methods (opens in a new tab)

  9. Constraint propagation and variable ordering heuristics for solving Constrained Partial CP-nets

    … preferences is one of the interesting research topics in Artificial Intelligence(AI). A conditional Preference Network (CP-net) is one of the extensively used graph models to represent these conditional preferences. Based on user-specific partial order for every value of a set of …

    regina Repository record for Constraint propagation and variable ordering heuristics for solving Constrained Partial CP-nets (opens in a new tab) Download PDF for Constraint propagation and variable ordering heuristics for solving Constrained Partial CP-nets (opens in a new tab)

  10. Randomization and Restart Strategies

    … satisfiability problems (SAT) using systematic backtracking search has been shown to exhibit great variability. Randomization and restarts is an effective technique for reducing such variability to achieve better expected performance. Several restart strategies have been proposed and studied in …

    waterloo Repository record for Randomization and Restart Strategies (opens in a new tab)