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

  1. Non-backtracking centrality measures and beyond

    … applications. Centrality measures based on non-backtracking walks have been shown to possess various benefits over other more simplistic walk-based centrality measures, such as not exhibiting localization [32] of centrality in network hubs. However, the combinatorics of computing nonbacktracking …

    aalto Repository record for Non-backtracking centrality measures and beyond (opens in a new tab)

  2. Code generation using a backtracking LR parser

    … research investigates the use of a backtracking LR parser that treats code generation as a series of tree transformations.

    wm-mary Repository record for Code generation using a backtracking LR parser (opens in a new tab)

  3. Execution backtracking using reverse execution of machine code

    Execution backtracking is the process of restoring the state of a program to an arbitrary point earlier in its execution history. It is used to facilitate program debugging. In this thesis, a novel execution backtracking approach is developed and implemented to assist the task of debugging …

    ubc Repository record for Execution backtracking using reverse execution of machine code (opens in a new tab) Download PDF for Execution backtracking using reverse execution of machine code (opens in a new tab)

  4. Semantics, analysis and security of backtracking regular expression matchers

    … drawn criticism for their use of a non-standard backtracking algorithm. In this research, we investigate the reasons for this deviation and develop a semantics view of regular expressions that formalizes the backtracking paradigm. In the process we discover a novel static analysis capable of …

    birmingham Download PDF for Semantics, analysis and security of backtracking regular expression matchers (opens in a new tab)

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

    … two types of real-time search enhancements, backtracking and value back-propagation. Based on this analysis, these two enhancements are re-formulated and avenues for their integration into the original LRTA* algorithm are presented. The new search enhancements are shown to improve …

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

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

  7. Adaptive backtracking planner for turn-efficient coverage in agricultural fields

    … complex fields. This thesis presents an adaptive backtracking planner that searches over a finite decision tree of lane-end choices using branch-and-bound together with a lightweight mechanism for regulating search effort. Paths are generated in continuous space with curvature constraints that …

    regina Repository record for Adaptive backtracking planner for turn-efficient coverage in agricultural fields (opens in a new tab)

  8. Backtracking Algorithm-Aided Design of a 10-Bit SAR ADC

    … and automatically generated using a recursive backtracking algorithm.Schematic-level simulation results for the ADC predict an effective number of bits (ENOB) of 9.39, worst case integral non-linearity (INL) and differential non-linearity (DNL) of 1.15 and 1 least significant bit (LSB), …

    carleton Repository record for Backtracking Algorithm-Aided Design of a 10-Bit SAR ADC (opens in a new tab)

  9. Runtime estimation of backtracking satisfiability solvers: a machine learning approach

    The Boolean Satisfiability Problem (SAT) is a prominent problem in theoretical computer science. While there is currently no known worst case polynomial bound for it, in practice, many computations terminate quickly. However, the runtime variance is large. In recent years, satisfiability solvers …

    unsw Repository record for Runtime estimation of backtracking satisfiability solvers: a machine learning approach (opens in a new tab)

  10. An evaluation of computer-supported backtracking in a hierarchical database

    … In the case of a database, undo translates to backtracking support. The first purpose of this research was to confirm that computer-supported backtracking tools reduce navigation time over manual backtracking. The second purpose was to compare navigation times among a subset of backtracking …

    vt Repository record for An evaluation of computer-supported backtracking in a hierarchical database (opens in a new tab)

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

    … we present some enhancement methods for backtracking-search in solving multiple permutation problems. Some well-known NP-complete multiple permutation problems are Quasigroup Completion Problem and Sudoku. Multiple permutation problems have been getting a lot of attention in the …

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

  12. The Non-Backtracking Spectrum of a Graph and Non-Bactracking PageRank

    … thesis studies two problems centered around non-backtracking walks on graphs. First, we analyze the spectrum of the non-backtracking matrix of a graph. We show how to obtain the eigenvectors of the non-backtracking matrix using a smaller matrix and in doing so, create a block diagonal …

    byu Repository record for The Non-Backtracking Spectrum of a Graph and Non-Bactracking PageRank (opens in a new tab) Download PDF for The Non-Backtracking Spectrum of a Graph and Non-Bactracking PageRank (opens in a new tab)

  13. Designing Multi-Mode Player Abilities to Enhance Backtracking in Metroidvania Levels

    … a multi-form ability system that supports varied backtracking while keeping progression readable. The prototype is a small-scale 2D Metroidvania game built around a single core ability with varying forms. The distinctive features of each form affect how players engage with obstacles, routes and …

    chalmers Repository record for Designing Multi-Mode Player Abilities to Enhance Backtracking in Metroidvania Levels (opens in a new tab)

  14. BiLSTM-guided neuro-symbolic semantic planning, re-planning, and backtracking for efficient emergency evacuation

    … event-driven re-planning together with reactive backtracking when a dead-end is reached. A bidirectional LSTM with two heads is then introduced as a strictly subordinate learned layer. One head estimates residual cost and is combined with the semantic heuristic through a bounded blend that …

    london-metro Download PDF for BiLSTM-guided neuro-symbolic semantic planning, re-planning, and backtracking for efficient emergency evacuation (opens in a new tab)

  15. RNA Polymerase II Backtracking in the Response to Oxidative DNA Damage and its Impact on Genome Instability

    … la Pol II y, en algunos casos, a su retroceso (backtracking) y bloqueo. Cuando la Pol II hace backtracking, el factor de transcripción SII (TFIIS) se une a la polimerasa, estimulando la escisión del transcrito para permitir el reinicio de la transcripción. El papel de TFIIS en el mantenimiento …

    sevilla Repository record for RNA Polymerase II Backtracking in the Response to Oxidative DNA Damage and its Impact on Genome Instability (opens in a new tab)

  16. Efficient satisfiability solver

    … be discussed and analyzed. Then we propose a new backtracking strategy, partial backtracking, which can be easily implemented in SAT solvers. It is essentially an extension of the backtracking strategy used in most SAT solvers. With partial backtracking, the solver consecutively amends the …

    iastate Repository record for Efficient satisfiability solver (opens in a new tab)

  17. Investigating the Physiological Effects of Mutations in the Proposed Backtrack Site of Yeast RNA Polymerase II

    … causing transcription to become arrested. When backtracking occurs, Pol II slides backwards on the DNA, displacing nascent RNA from the active site into a proposed “backtrack site,” comprising residues in the Pol II subunits Rpb1 and Rpb2 that interact with the RNA. The resulting stable …

    oregon Repository record for Investigating the Physiological Effects of Mutations in the Proposed Backtrack Site of Yeast RNA Polymerase II (opens in a new tab)

Page 1 of 14