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 “"Value ordering"”.

  1. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability

    … objective functions and describe three value-ordering methods based on iterative optimization techniques. We implement and test these heuristics in the widely-recognized MiniSAT framework. The first approach determines polarities by applying Newton's Method to a sparse system of …

    waterloo Repository record for Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability (opens in a new tab)

  2. Using Conflict and Support Counts for Variable and Value Ordering in CSPs

    … by reducing the search space. Variable and Value Ordering is one of them. Many experiments and analyses have been conducted to show that good ordering of variables and values can significantly reduce the size of the search space and thus make the search more efficient. Many heuristics have …

    regina Repository record for Using Conflict and Support Counts for Variable and Value Ordering in CSPs (opens in a new tab) Download PDF for Using Conflict and Support Counts for Variable and Value Ordering in CSPs (opens in a new tab)

  3. Search in weighted constraint satisfaction problems

    … 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 methods in …

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

  4. Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems

    … based on the resemblance between the optimal value ordering and the approximate value ordering generated by them. The results showed that xAC generated value orderings of higher quality than W-AC*2001 and EDAC. We evaluated some novel hybrid methods for solving COPs. Hybrid methods combine …

    sask Repository record for Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems (opens in a new tab)

  5. Some Enhancement Methods For Backtracking-Search In Solving Multiple Permutation Problems

    … novel notion of interlinking dynamic variable ordering with dynamic value ordering, where the dynamic value ordering is also used as a second tie-breaker for the dynamic variable ordering. We also proposed the concept of integrating dynamic variable ordering and dynamic value ordering into an …

    cuny-grad Repository record for Some Enhancement Methods For Backtracking-Search In Solving Multiple Permutation Problems (opens in a new tab)

  6. Properties of residual mixing distributions resulting from arbitrary mixtures of exponential life distributions

    … in the population. Properties of expected value ordering, stochastic ordering, failure rate ordering and likelihood ration ordering are investigated to show that, of these, only likelihood ratio ordering between the initial mixing distributions is sufficient to guarantee an ordering between …

    nps Repository record for Properties of residual mixing distributions resulting from arbitrary mixtures of exponential life distributions (opens in a new tab)

  7. Heuristically guided constraint satisfaction for AI planning

    … encoding together with a new variable / value ordering heuristic. This ordered, goal oriented guidance reduces the search space and better directs the search focus. The system also makes use of novel meta variable techniques for goal locking and resource assignment. These improve …

    strathclyde Repository record for Heuristically guided constraint satisfaction for AI planning (opens in a new tab)

  8. Adaptive strategies for solving contraint satisfaction problems

    … 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 then perform a …

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

  9. Integrating Probabilistic Reasoning with Constraint Satisfaction

    … wherein a given variable is assigned a given value. By devising search methods that incorporate such information as heuristic guidance for variable and value ordering, we are able to outperform existing solvers on problems of interest from constraint satisfaction and constraint …

    toronto-retro Repository record for Integrating Probabilistic Reasoning with Constraint Satisfaction (opens in a new tab)

  10. Issues in Group Sequential/Adaptive Designs

    … In the second project, we define the complete ordering of a group sequential sample space and show that a Wang-Tsiatis boundary family or an exponential spending function family can completely order the sample space. We also propose a simple method to transform a spending function to a …

    penn Repository record for Issues in Group Sequential/Adaptive Designs (opens in a new tab)