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 9 of 9 for “"Dynamic Data Structures"”.
-
Dynamic Data Structures for Two Dimensional Searching
In this thesis we investigate dynamic data structures and algorithms for searching in a subdivision of the plane. Three specific problems have been addressed in this area. The first problem, dynamic point location, considers a geometric subdivision of the plane into polygonal regions, and asks for …
-
GreenC5: An Adaptive, Energy-Aware Collection for Green Software Development
<p>Dynamic data structures in software applications have been shown to have a large impact on system performance. In this paper, we explore energy saving opportunities of interface-based dynamic data structures. Our results suggest that savings opportunities exist in the C5 Collection between …
-
Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems
… solution accuracy. Implementations with static data structures often fail in practice because of unpredictable memory requirements. This is especially critical in S⁴W (Site-Specific System Simulator for Wireless communication systems), where the DIRECT optimization is just one small component …
-
Efficient data structures for information retrieval
… deals with the application of efficient data structures and hashing algorithms to the problems of textual information storage and retrieval. We have developed static and dynamic techniques for handling large dictionaries, inverted lists, and optimizations applied to ranking algorithms. We …
-
Geometric set cover and related geometric optimization problems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms
-
Randomized Data Structures: New Perspectives and Hidden Surprises
… most basic questions in the theory of randomized data structures—questions such as: How efficient is a linear probing hash table? How fast can you maintain a sorted array of numbers? How big does a pointer have to be? With the help of new techniques, along with a willingness to look beyond …
-
Design and Evaluation of a Data-distributed Massively Parallel Implementation of a Global Optimization Algorithm---DIRECT
… an efficient, portable, and robust design of a data-distributed massively parallel DIRECT, the deterministic global optimization algorithm widely used in multidisciplinary engineering design, biological science, and physical science applications. The original algorithm is modified to adapt to …
-
Development of Finite Element Modeling Mesh Generation and Analysis Software for Light Wood Frame Houses
… program relies on the use of STL as it provides dynamic data structures, algorithms for storage, searching, sorting, etc. Efficiency of the program is improved by the use of the in-built features in STL instead of developing new code. Analysis of the finite element models generated by the …
-
The tasks with effects model for safe concurrency
… should offer strong safety guarantees such as data race freedom, atomicity, and optional determinism, while being flexible enough to express the wide range of uses for concurrency in realistic programs, and offering good performance and scalability. In my thesis research, I have defined a new …