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 10 of 10 for “"Shortcutting"”.
-
Introducing Non-Determinism to the Parallel C Compiler
… SOS<br />(ipStreams, Overlapping and Shortcutting), a function library that supports<br />the three named functionalities, can be used to further optimize parallel algorithms.</p> <p><br />This project is the next step in the continuing project of updating<br />the PC Compiler. The …
-
Parallelizing a nondeterministic optimization algorithm
… a parallel compiler, PC, is used to apply shortcutting techniquest to a metaheuristic Ant Colony Optimization (ACO), to solve the well-known Traveling Salesman Problem (TSP) on a cluster running Message Passing Interface (MPI). The results of both serial and parallel execution are compared …
-
Parallelizing a nondeterministic optimization algorithm
… a parallel compiler, PC, is used to apply shortcutting techniquest to a metaheuristic Ant Colony Optimization (ACO), to solve the well-known Traveling Salesman Problem (TSP) on a cluster running Message Passing Interface (MPI). The results of both serial and parallel execution are compared …
-
Making Curry with Rice: An Optimizing Curry Compiler
… shortcut deforestation, unboxing, and case shortcutting, a new optimization we developed specifically for functional logic language. We show the correctness of these optimizations and demonstrate their effectiveness. In particular, we show that RICE outperform previous compilers by 2 or 3 …
-
ASAP: a low-latency transport layer
… protocol that significantly reduces latency by shortcutting DNS requests and eliminating TCP’s three-way handshake (3WH). Meanwhile, ASAP ensures the key security property of verifiable provenance of client requests which is originally provided by 3WH, yet avoids the need for a handshaking step …
-
Extremal problems on cycles, packing, and decomposition of graphs
… suffices for S to be 6.5k-edge-connected in G. A shortcutting operation on a graph G replaces a path in G by an edge joining its endpoints. An S-connector of G is a subgraph of G from which after some shortcutting operations we get a connected graph with vertex set S. In Chapter 3, we also show …
-
Implementation of Tetris as a Model Counter
… adding techniques that allow for intelligent shortcutting where possible. In particular, we have introduced various strategies that allow us to significantly reduce the number of database calls while not adding a significant amount of overhead. Fourth, we have found a natural set of model …
-
New Behavioral Insights Into Home Range Orientation of the House Mouse (Mus musculus)
… map, and not from the other two options of novel shortcutting: guidance orientation or path integration. Thus by designing my experiments to eliminate the potential for the mice to rely on a guiding cue to direct them home, and by eliminating the ability to compute a shortcut by summing the …
-
Nutrient Removal of Biochar Amended Modified Bioretention Systems Treating Nursery Runoff
… studies, the microporosity of biochar prevented shortcutting and increased the mean retention time spent in the IWSZ. Average total load reductions improved for both total inorganic nitrogen (TIN) and total phosphorus (TP) as the HLR decreased, height of the IWSZ increased, and with biochar …
-
Optimizing Parallel Graph Analytics through Advanced Innovative Techniques
The exponential increase in the volume of data humans produce has prompted the data analytics field to grow rapidly over the last decade. In particular, the interest in analyzing and extracting information from large graphs has risen sharply. However, the extensive size and high complexity of some …