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 5 of 5 for “"Variable ordering heuristics"”.

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

    … partial order for every value of a set of variables, a CP-net is constructed in ceteris paribus (all else being equal). A Partial CP-net can be used if a user does not specify the order for every variable value. The Search-Partial-CP algorithm can be used for reasoning and producing a set …

    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)

  2. Search in weighted constraint satisfaction problems

    … instances used. We have examined some existing variable ordering heuristics and defined new ones. An analysis methodology has been defined that allows the characteristics of good solutions to be identified. Different methods of identifying difficult to solve sub-problems and the use of such …

    whiterose Download PDF for Search in weighted constraint satisfaction problems (opens in a new tab)

  3. Conditional Preference Networks: Learning and Optimization

    … i.e., a Pareto set. We study the e ect of variable ordering heuristics and constraint propagation to the problem and show that a variable ordering heuristic augmented with constraint propagation yields a saving to the solving process.

    regina Repository record for Conditional Preference Networks: Learning and Optimization (opens in a new tab) Download PDF for Conditional Preference Networks: Learning and Optimization (opens in a new tab)

  4. Solving Quantified Boolean Formulas

    … learning methods to dynamically select the best variable ordering heuristics during search.

    toronto-retro Repository record for Solving Quantified Boolean Formulas (opens in a new tab)

  5. Adaptive strategies for solving contraint satisfaction problems

    … First, we investigate adaptive search guiding heuristics for ordering variables in CSPs. These adaptive heuristics learn and use information from every node explored in the search tree whereas traditional static and dynamic heuristics only use information about the initial and current nodes. We …

    greece Repository record for Adaptive strategies for solving contraint satisfaction problems (opens in a new tab)