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 69 for “"Sorting algorithms"”.
-
Self-stabilizing sorting algorithms
… presents an O(nh) fault-tolerant distributed sorting algorithm for a tree network, where n is the number of nodes in the system, and h is the height of the tree. Fault-tolerance is achieved using Dijkstra's paradigm of self-stabilization which is a method of non-masking fault-tolerance …
-
PARALLEL SORTING ALGORITHMS ON GRID STRUCTURES
The parallelism of three grid-based sorting algorithms are explored in this dissertation: ( 1) Parallel Square Gridsort (PSGS) - grid points are represented by [ij], where i is the row index and j is the column index, (2) Parallel Cubic Gridsort (PCGS) - grid points are represented by [k,i,j], …
-
Adaptive sorting algorithms for evaluation of automatic zoning
… minimal cost. This problem has been modeled as sorting an arbitrary permutation. This thesis presents few adaptive sorting approaches which can be incorporated into the automatic zoning evaluation algorithm. These algorithms perform better than the existing algorithms used for this purpose. This …
-
Implementation of parallel sorting algorithms on a transputer network
<p>Many sorting algorithms, such as the bubble sort and the binary tree selection sort, are n-squared algorithms and take O (n2) time to sort n values. These can be easily parallelized; the resulting sorts are called the odd-even transposition sort and the parallel tree selection sort, …
-
Validation of the Rice Parallel Processing Testbed using sorting algorithms (Rice University, Texas)
The Rice Parallel Processing Testbed (RPPT) is software package for simulating the execution of parallel computers. The RPPT employs execution driven simulation to perform simulation efficiently. In this thesis, the demonstration that the RPPT is accurate is made by comparing the performance of …
-
Rūšiavimo algoritmų vizualizavimas ir sudėtingumo analizė /
There is a lot of complexity analysis of sorting algorithms can be found without problems, so the main idea of this work was to create a visualization of sorting algorithms. This work was created three simple sorting algorithms (insertion sort, bubble sort and selection sort), and two high-speed …
-
Ανάπτυξη διαδικτυακού εκπαιδευτικού περιβάλλοντος δυναμικής οπτικοποίησης αλγορίθμων ταξινόμησης πινάκων και μελέτη της συμβολής του στην αλγοριθμική σκέψη μαθητών λυκείου
… the globe. Literature suggests that arrays and sorting algorithms are among the most advanced concepts students encountered in an introductory algorithmic and programming course.These concepts are difficult to comprehend by students because they refer to abstract entities for which it is not …
-
Web-based interactive self-evaluation system for computer science in generic tutorial system for the sciences project
… for computer science; in particular, analysis of sorting algorithms.
-
Web-based interactive self-evaluation system for computer science in generic tutorial system for the sciences project
… for computer science; in particular, analysis of sorting algorithms.
-
Fast parallel algorithms for sorting and median finding
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random data. Unfortunately many real-world applications require sorting on data that is not uniformly distributed. In this thesis, we propose a new strategy, A-ranksort, for …
-
Characterizing single neuron activity patterns and dynamics using multi-scale spontaneous neuronal activity recordings of cat and mouse cortex
… yielded novel datasets for testing spike sorting algorithms which are critical for isolating single neuron activity. Sorting algorithms tested provided low error rates with operator skill being as important as sorting suite. Simulated datasets have similar characteristics to in vivo …
-
Accelerating MOEA Non-dominated Sorting by Preserving Archival Relationships
Non-dominated sorting is an important part of many multi-objective evolutionary algorithms (MOEAs). It is used to determine which individuals to keep in the archive of best individuals between generations and to evaluate fitness for breeding. Because this sorting is performed after every …
-
Automatic Algorithm Recognition Based on Programming Schemas and Beacons - A Supervised Machine Learning Classification Approach
… thesis, we present techniques to recognize basic algorithms covered in computer science education from source code. The techniques use various software metrics, language constructs and other characteristics of source code, as well as the concept of schemas and beacons from program comprehension …
-
Bulk updates and cache sensitivity in search trees
… Bulk updates are also applied to adaptive sorting. Cache-sensitive data structures are tailored to the hardware caches in modern computers. The thesis presents a method for adding cache-sensitivity to binary search trees without changing the rebalancing strategy. Cache-sensitivity is …
-
OPTIMIZING AND BENCHMARKING SPIKE SORTING PIPELINES FOR HIGH-DENSITY NEURAL RECORDINGS
Accurate spike sorting is essential for interpreting extracellular neural recordings, yet its performance is often sensitive to probe geometry, recording noise, experimental settings, and algorithm parameters. In this study, I evaluated and optimized a spike sorting pipeline for 64-channel …
-
Virtualiosios realybės mokymosi aplinkų panaudojamumas /
… the user with knowledge of data structures and algorithms university course’s sorting algorithms. The developed application system was tested by a group of users and positive feedback was collected, which shows that such systems can be used to enhance the learning process.
-
Searching real numbers in constant time
… Through an exploration of comparison-based sorting algorithms and the conversion of real numbers into integers using Han’s algorithm [6], we establish a comprehensive framework capable of seamlessly handling both integers and real numbers. This research not only enhances the efficiency of …
-
Modular Multiple Liquidity Source Price Streams Aggregator
… in detail. The core part of Master Project are sorting algorithms, these are covered on theoretical and practical level. Aggregator design includes implementation environment, specification and individual parts of aggregator application represented as objects. Implementation overview can be …
Page 1 of 4