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 7 of 7 for “"Backtracking Algorithms"”.

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

    … reasoning represent two core problems in AI. Backtracking based algorithms have been applied in both problems. In this thesis, I investigate structure-based techniques for solving real world SAT and Bayesian networks, such as software testing and medical diagnosis instances. When solving a SAT …

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

  2. Backtracking and value back-propagation in real-time search

    … This thesis focuses primarily on real-time algorithms that converge to optimal solutions through repeated trials. This work concentrates on two things, firstly it provides an extensive evaluation of established real-time algorithms that seek optimal solutions. While validating earlier …

    reykjavik Repository record for Backtracking and value back-propagation in real-time search (opens in a new tab)

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

    … SAT is most commonly solved by a form of backtracking search which systematically explores the space of possible variable assignments. We show that the order in which variable polarities are assigned can have a significant impact on the performance of backtracking algorithms. We present …

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

  4. Towards a Quantum Speedup via Applications and Architectures

    … achieved through applying a quantum speedup for Backtracking algorithms to classical algorithms for solving the Travelling Salesman Problem when the degree of the graph is at most 3 or 4. We then obtain further polynomial speedups when the degree of the graph is at most 6, by a combination of …

    bristol Repository record for Towards a Quantum Speedup via Applications and Architectures (opens in a new tab) Download PDF for Towards a Quantum Speedup via Applications and Architectures (opens in a new tab)

  5. Comparative Analysis and Optimization of Control Strategies for Single Axis Tracking Solar Arrays on Skewed Topography

    … challenges to performance optimization. Standard backtracking algorithms can generate potential losses due to interrow shading caused by sloped terrain as well as a lack of plane of array irradiance that can occur even on level ground. The purpose of this thesis is to use the Gold Tree site as a …

    calpoly Repository record for Comparative Analysis and Optimization of Control Strategies for Single Axis Tracking Solar Arrays on Skewed Topography (opens in a new tab)

  6. Heuristic Approaches to Solve the Frequency Assignment Problem

    … solved using novel and existing metaheuristic algorithms and their relative successes were compared. Early work of this thesis used greedy, steepest descent and backtracking algorithms as a means of investigating the factors which influence the performance of an algorithm (selection of …

    goldsmiths Repository record for Heuristic Approaches to Solve the Frequency Assignment Problem (opens in a new tab) Download PDF for Heuristic Approaches to Solve the Frequency Assignment Problem (opens in a new tab)

  7. Computational methods for domination problems

    … This thesis studies practical exponential time algorithms for solving domination problems, and presents an experimental comparison of several different algorithms, with the goal of producing a broadly effective general domination solver for use by future researchers. The developed algorithms are …

    uvic Repository record for Computational methods for domination problems (opens in a new tab)