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 20 of 26 for “"VARIABLE ORDERING"”.

  1. Variable ordering for ROBDD-based FPGA logic synthesis

    … with this representation, however, is that the variable ordering can have a very large effect on the size of the ROBDD. Another way of representing a function is with its autocorrelation coefficients. These provide information about areas of similarity in a function. This thesis presents methods …

    uvic Repository record for Variable ordering for ROBDD-based FPGA logic synthesis (opens in a new tab)

  2. 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)

  3. 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)

  4. Digital logic testing and verification using ordered binary decision diagrams

    … Ordered Binary Decision Diagrams and several ordering techniques to satisfy this need. The OBDD program was implemented and tested on ISCAS89 benchmark circuits. A translator was developed to convert the benchmark circuits into a format that could be read by the OBDD program. The effect of …

    ttu Repository record for Digital logic testing and verification using ordered binary decision diagrams (opens in a new tab)

  5. 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)

  6. 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)

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

    … the 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 …

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

  8. Applying binary decision diagrams to learn hidden Markov models

    … that the BDD’s size significantly depends on the variable ordering (a problem known to be NP-complete). Preliminary experiments showed that the BDD size grows exponentially with the size of the input, giving the EM-BDD algorithm the same time complexity as the BW algorithm on average. However, …

    reykjavik Repository record for Applying binary decision diagrams to learn hidden Markov models (opens in a new tab)

  9. Backdoors in Satisfiability Problems

    … properties of instances. Backdoors are a set of variables for which there exists some value assignment that leads to a polynomial-time solvable sub-problem. I address in this thesis the problem of finding all minimal backdoors, which is essential for studying value and variable ordering mistakes. …

    waterloo Repository record for Backdoors in Satisfiability Problems (opens in a new tab)

  10. Automated combination of probabilistic graphic models from multiple knowledge sources

    … we present three heuristic methods of target variable ordering generation. Such methods show their feasibility through our experiments and are good in different situations. Furthermore, we discuss influence diagram combination and present a utility-based method to combine probability …

    nus Repository record for Automated combination of probabilistic graphic models from multiple knowledge sources (opens in a new tab) Download file for Automated combination of probabilistic graphic models from multiple knowledge sources (opens in a new tab)

  11. Solver Tuning with Genetic Algorithms

    … the level of preprocessing to be used, the variable ordering heuristic or the suitable modelling approach. The efficient and automatic mechanism of parameters tuning for a constraint solver is a step towards making constraint programming a more widely accessible technology. Two types of …

    dundee Repository record for Solver Tuning with Genetic Algorithms (opens in a new tab) Download PDF for Solver Tuning with Genetic Algorithms (opens in a new tab)

  12. 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)

  13. Mathematical modelling of active nematic liquid crystals in confined regions

    … allows for an investigation into the effects of variable ordering caused by changes in the temperature. Finally, we investigate active nematics confined in two-dimensional regions. We first consider wedge geometries containing an active nematic with a singularity at the wedge corner, deriving …

    strathclyde Repository record for Mathematical modelling of active nematic liquid crystals in confined regions (opens in a new tab)

  14. Memory constrained algorithms for multi-valued decision diagrams

    … algorithms. Previous methodologies, such as variable ordering, demonstrate that choosing the right variable order has an influence on the size of the MDDs. Other studies on approximation and manipulation of high-density (finite but large) state systems shows the importance of efficient …

    iastate Repository record for Memory constrained algorithms for multi-valued decision diagrams (opens in a new tab)

  15. AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS

    … specify how a search algorithm can instantiate a variable and how a problem can be reduced into subproblems; that is, they define a search tree. In spite of the apparent importance of the branching strategy, there have been only a few empirical studies about different branching strategies and they …

    waterloo Repository record for AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS (opens in a new tab)

  16. Exploiting Structure in Backtracking Algorithms for Propositional and Probabilistic Reasoning

    … a sequence of decisions must be made as to which variable to branch on or instantiate next. Real world problems are often amenable to a divide-and-conquer strategy where the original instance is decomposed into independent sub-problems. Existing decomposition techniques are based on pre-processing …

    waterloo Repository record for Exploiting Structure in Backtracking Algorithms for Propositional and Probabilistic Reasoning (opens in a new tab)

  17. Development of a New Parallel Thermal Reservoir Simulator

    … An analytical Jacobian calculation method and a variable alignment scheme are developed in this thesis. They have the ability to simulate three-dimensional multi-component three-phase thermal processes, and are capable of determining different property estimation approaches, such as correlations …

    calgary Repository record for Development of a New Parallel Thermal Reservoir Simulator (opens in a new tab)

Page 1 of 2