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 42 for “"SEARCHING ALGORITHMS"”.
-
The use of searching algorithms for the minimization of Multi-Valued Logic functions
The goal of this thesis was to develop a searching algorithm for simplifying Multi-Valued Logic (MVL) functions. The algorithm was implemented as a program written in C for the UNIZ operating system. The algorithm accepts an MVL function in the format required by HAMLET, an MVL computer aided …
-
Foraging in the Presence of Obstacles
This thesis focuses on investigating searching algorithms which can solve the Ants Nearby Treasure Search (ANTS) Problem in the presence of obstacles. In the ANTS problem, there are k ants initially located at the origin in a two-dimensional grid. Pheromones are used as physical markers to allow …
-
Ανάλυση μέσης περίπτωσης αλγορίθμων ψαξίματος σε γράφους
… various search quantities for a variety of graph-searching methods, for example \dfs\ and \bfs. Our analysis applies to both directed and undirected random graphs, and it covers the range of interesting graph densities, including densities at which a random graph is disconnected with a giant …
-
Combinatorial algorithms in the approximate computing paradigm
… and computational resource usage in sorting and searching problems. It introduces the concept of Approximate Sorting, which aims to reduce resource usage while maintaining an accepted level of sorting quality. Quality metrics are defined to assess the ”sortedness” of approximately sorted arrays. …
-
3D žaidimo “The Afterworld” kūrimas naudojant Unity platformą /
… Two NPC management systems and three path searching algorithms were implemented. The algorithms were compared to the Unity AINavigation tool and its navigation algorithm.
-
Comparação entre técnicas de tratamento de restrições em algoritmos evolutivos
… approaches to handle constraints in evolutionary algorithms, measuring its performances in two different searching algorithms, differential evolution and particle swarm optimization. The well-known CEC 2006 suite of benchmark functions was the set of problems used as case studies. The work …
-
Subsequences and Supersequences of Strings
… two books [M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1995] and [G. Stephen, String Searching Algorithms, World Scientific, 1994] have been published on the subject and at least two others are known to be in preparation. Problems on strings arise in information …
-
High Clearance Collision-Free Paths
… to the goal point. We review existing well known algorithms for solving the path planning problem. We propose new approaches for constructing a collision-free path with high clearance from obstacles. The main idea of the proposed algorithm is the appropriate generation free-region nodes which can …
-
Efficient multiprocessor scheduling based on genetic algorithms
… sub-optimal solutions to the problem. Genetic algorithms have recently received much attention as robust stochastic searching algorithms for various optimization problems. In this thesis, we propose an efficient method based on genetic algorithms to solve the multiprocessor scheduling problem. …
-
Joint beamforming, channel and power allocation in multi-user and multi-channel underlay MISO cognitive radio networks
… relaxation (SDR) approach. Next, two explicit searching algorithms, i.e., genetic algorithm (GA) and simulated annealing (SA)-based algorithm are proposed to determine optimal channel allocations. Simulation results show that beamforming, power and channel allocation with SA (BPCA-SA) algorithm …
-
Searching for Shortest and Safest Paths Along Obstacle Common Tangents
… allowing common tangent construction and path searching algorithms to process complex geometrical shapes in an efficient and symbolically unique fashion. Dijkstra's algorithm is implemented using heuristic control for optimal path searching. The framework for utilizing constant clearance strips …
-
Peptide Fragmentation and Amino Acid Quantification by Mass Spectrometry
… the rules governing this process into search algorithms. This study elucidates the chemical 'rules' governing peptide dissociation. It is believed that these 'rules' can be incorporated into searching algorithms to achieve better protein identification. The present study focuses on the effects …
-
Media processing and retrieval model for multimedia documents databases.
… a data structure, indexing and finally content searching algorithms. Our interests focus on the first four components of such system. In this thesis, we propose a multimedia query specification language that can be used to fully describe a multimedia segment that needs to be received from a …
-
Spatial mode control and advanced methods for multi-platform quantum communication
… keys, quantum simulation, and quantum-enhanced searching algorithms will likely become viable within a few decades. Such computers demand communication networks that preserve the qualities of the quantum states used as inputs and outputs; they also herald the end of the flavors of classical …
-
Conformer Searching
Conformer searching algorithms find minima in the Potential Energy Surface (PES) of a molecule, usually by following a torsion-driven approach. The minima represent conformers, which are interchangeable via free rotation around bonds. Conformers can be used as input to computational analyses, such …
-
Towards Single-Cell Proteomics: Integrated Methods Relying on Digital Microfluidics and Mass Spectrometry
… 4 compares seven commonly used protein database searching algorithms against three sets of single-cell proteomics data. The differences in identification in this dataset highlight the importance of algorithm selection and continued development of new algorithms for specific applications in the …
-
Suffix trees for very large inputs
… tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suffix trees are larger than their input sequences and …
-
3D visualisation of oil reservoirs
… that when coupled with bespoke scanning methods searching times can surpass that of direct access. Hierarchical pyramid visualisations techniques are also presented using the information stored at each level in the tree structure. Integrating with this are face culling algorithms developed in …
-
Computational chemistry studies of prenyltransferases and small ligands
… from traditional systematic and stochastic searching algorithms, this method uses probability information to facilitate the selection of the best conformations. The generated ensembles provided good coverage of the available conformation space including available crystal structures. …
Page 1 of 3