Sökning: "Search Trees"
Visar resultat 1 - 5 av 24 avhandlingar innehållade orden Search Trees.
1. Lock-free Concurrent Search
Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER
2. Split Trees, Cuttings and Explosions
Sammanfattning : This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. LÄS MER
3. Coordinated Voltage Control in Electric Power Systems
Sammanfattning : This thesis deals with various aspects of coordinated voltage control in electric power systems. It consists of an introduction and six papers. The introduction contains a summary of the thesis and tutorials on voltage control and the search methods that have been applied. LÄS MER
4. Random Records and Cuttings in Binary Search Trees
Sammanfattning : .... LÄS MER
5. Multi-Agent Mission Planning and Execution for Small Autonomous Underwater Vehicles
Sammanfattning : Our planet is mostly covered in water, most of it still unexplored.In order to understand our environment better, oceanographers have been mapping and monitoring these waters using ship-mounted sensors and wired vehicles with limited range compared to the vastness of the oceans. LÄS MER
