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 24 for “"Backtracking algorithm"”.
-
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), …
-
Enumeration of inequivalent cycle decompositions
… on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n.
-
Solar Energy Generation Forecasting and Power Output Optimization of Utility Scale Solar Field
… accuracy. The optimization method utilizes the backtracking algorithm already installed in the system and the pitch distance to control the angle of the tracker and reduces solar panels partial shading on the adjacent row to improve system output. With pitch distances reduced in the backtracking …
-
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 …
-
The Closure of the Minimal k-core Problem for Modeling k-assemblies
In this thesis, I present a backtracking algorithm to find all minimal k-cores of a given undirected graph, which belongs to the class of NP-hard problems. The proposed method is a modification of the Bron and Kerbosch algorithm for finding all cliques of an undirected graph. The minimal k-core …
-
Gene order alignment on a phylogeny with BOPAL 2.0
… The following research builds upon a previous algorithm called BOPAL which utilized operon information to better infer orthologous genes. The following research modifies BOPAL to properly handle singleton genes, adds a second pass to utilize previously inferred ancestors, and simplifies the …
-
O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico
… Graphs, and proposes two classes of solution algorithms. The first class, belonging to the exact algorithms, is formed by a backtracking algorithm planed with a return through logical rules and limiting the best found solution. The second class of algorithms is composed by metaheuristics type …
-
Compiler Support for Fine-grain Software-only Checkpointing
… software rollback mechanisms when coding a backtracking algorithm, with runtime overhead of only 15% compared to the manual implementation. Finally, we utilize the efficient software-only checkpointing to support overlapping execution with delinquent loads through the demonstrations both …
-
Agglomerative clustering for community detection in dynamic graphs
… from random chance. Various fast and efficient algorithms for community detection based on modularity maximization have been developed for static graphs. However, since many (contemporary) networks are not static but rather evolve over time, the static approaches are rendered inappropriate for …
-
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 …
-
A pattern matching system for biosequences.
… been discovered, and a large number of practical algorithms has been developed for efficiently matching various classes of patterns. A variety of general pattern matching tools and specialized programming languages have been implemented for applications in areas such as lexical analysis, text …
-
A Heuristic Nonlinear Constructive Method for Electric Power Distribution System Reconfiguration
… The problem is combinatorial, which precludes algorithms that guarantee a global optimum. Most existing reconfiguration algorithms fall into two categories. In the first, branch exchange, the system operates in a feasible radial configuration and the algorithm opens and closes candidate …
-
Some Results in Extremal Combinatorics
… have also devised an efficient problem-specific backtracking algorithm and computed twenty-five new van der Waerden numbers with k>=3 using that algorithm. We have proven some counting properties of arithmetic progressions and some unimodality properties of sequences regarding arithmetic …
-
Online Monitoring of Distributed Systems Using Causal Event Patterns
… applications. Our first pattern-matching algorithm, OCEP introduces a backtracking algorithm to efficiently find a representative subset from the history of events. An evaluation of the framework shows that OCEP is capable of handling several frequently occurring violation patterns at the …
-
Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns
… lattice paths in an osculating manner. Using a backtracking algorithm to process the lattice paths, we identify over 5 million distinct prime patterns. This is well in excess of the roughly 1,000 found in lace ground catalogues. The lattice paths used in our approach are members of a family of …
-
Clique Generalizations and Related Problems
… and the minimum k-core problem. I present a backtracking algorithm to find all minimal k-cores of a given undirected graph and its applications to the study of associative memory. The proposed method is a modification of the Bron and Kerbosch algorithm for finding all cliques of an undirected …
-
From Mark-Resight to Management: Bayesian Hierarchical Models for Endangered Bird Populations
… in a Markov Chain Monte Carlo framework using a backtracking algorithm, and I apply this approach in the context of a multi-event model to the Oregon Vesper Sparrow (Pooecetes gramineus affinis) in South Puget Sound, Washington, USA. The results from this model constitute some of the first …
-
Studies of protein designability using reduced models
… 2D square lattice, and we use machine learning algorithms to classify binary sequences folding to highly- or poorly-designable conformations.;In the first part of the thesis we extend the transfer matrix method to the 2D triangular lattice. The transfer matrix method is a highly efficient method …
-
Επιχειρησιακή έρευνα στον τομέα της ναυτιλίας: υποστήριξη αποφάσεων δρομολήγησης πλοίων για μεταφορά φορτίων
… of a set of cargos. The proposed method uses a backtracking algorithm along with time and capacity constraints in order to reduce the search space and generate the schedule routes in a reasonable time. The advantage of the proposed method in contrast to the majority of methods which are …
-
Efficient algorithms for flow models coupled with geomechanics for porous media applications
… and analyze iterative and explicit coupling algorithms for coupling flow and geomechanics in both poro-elasitc and fractured poro-elastic reservoirs. The analysis of iterative coupling schemes relies on studying the equations satisfied by the difference of iterates and using a Banach …
Page 1 of 2