Results

Looking for more? ProQuest® Dissertations & Theses has additional dissertations and theses.
21460 open access dissertations and theses found for:
if(Parallel algorithms)  »   Refine Search
1.
Parallel functional programming with mutable state
by Bergstrom, Lars, Ph.D.  The University of Chicago. 2013: 133 pages; 3568360.
2.
Efficient primitives and algorithms for many-core architectures
by Sengupta, Shubhabrata, Ph.D.  University of California, Davis. 2010: 164 pages; 3444098.
3.
Heterogeneous construction of spatial data structures
by Butts, Robert O., M.S.  University of Colorado at Denver. 2015: 65 pages; 1588178.
4.
Provably Efficient Algorithms for Numerical Tensor Algebra
by Solomonik, Edgar, Ph.D.  University of California, Berkeley. 2014: 256 pages; 3686016.
5.
Real-time solid voxelization using multi-core pipelining
by Liao, Duoduo, Ph.D.  The George Washington University. 2009: 191 pages; 3344878.
6.
Automatically tuning collective communication for one-sided programming models
by Nishtala, Rajesh, Ph.D.  University of California, Berkeley. 2009: 176 pages; 3402682.
7.
Evolving effective micro behaviors for real-time strategy games
by Liu, Siming, Ph.D.  University of Nevada, Reno. 2015: 106 pages; 3707862.
8.
A Big Spatial Data System for Efficient and Scalable Spatial Data Processing
by Da, Yanan, M.S.  Southern Illinois University at Edwardsville. 2017: 57 pages; 10682760.
9.
High performance methods for frequent pattern mining
by Vu, Lan, Ph.D.  University of Colorado at Denver. 2014: 190 pages; 3667246.
10.
Alliances in graphs: Parameterized algorithms and on partitioning series -parallel graphs
by Enciso, Rosa I., Ph.D.  University of Central Florida. 2009: 108 pages; 3401073.
11.
Gunrock: A Programming Model and Implementation for Graph Analytics on Graphics Processing Units
by Wang, Yangzihao, Ph.D.  University of California, Davis. 2017: 134 pages; 10251096.
12.
Parallelism and error reduction in a high performance environment
by Castaldo, Anthony M., Ph.D.  The University of Texas at San Antonio. 2010: 117 pages; 3433204.
13.
14.
Separating control from specification for parallel and distributed search algorithms
by See, Andrew G., Ph.D.  University of Connecticut. 2009: 173 pages; 3384551.
15.
Any-Com Multi-Robot Path Planning
by Otte, Michael Wilson, Ph.D.  University of Colorado at Boulder. 2011: 194 pages; 3489609.
16.
Tideflow: A dataflow-inspired execution model for high performance computing programs
by Orozco, Daniel A., Ph.D.  University of Delaware. 2012: 163 pages; 3527015.
17.
Fast modular exponentiation using residue domain representation: A hardware implementation and analysis
by Nguyen, Christopher Dinh, M.S.  University of Maryland, Baltimore County. 2013: 129 pages; 1551346.
18.
An I/O-Complexity Lower Bound for All Recursive Matrix Multiplication Algorithms by Path-Routing
by Scott, Jacob N., Ph.D.  University of California, Berkeley. 2015: 113 pages; 10086162.
19.
Topics in communication avoiding algorithms and stability analysis
by Lowery, Bradley R., Ph.D.  University of Colorado at Denver. 2014: 136 pages; 3621837.
20.
Flexible Architectures for Enhanced Security
by Chang, Jed Kao-Tung, Ph.D.  University of California, Irvine. 2012: 149 pages; 3518799.
22.
The Hybrid Task Graph Scheduler
by Blattner, Timothy, Ph.D.  University of Maryland, Baltimore County. 2016: 152 pages; 10245475.
23.
Linear programming with the simplex algorithm: Parallelization and other optimizations
by Ankony, Robert C., M.S.C.S.  California State University, Long Beach. 2012: 88 pages; 1520889.
24.
Observer-based feedback control for stabilization of collective motion
by Napora, Seth Ochse, M.S.  University of Maryland, College Park. 2011: 68 pages; 1501278.
25.
Time dependent vehicle routing in a large road network
by Zhang, Zhu, M.S.  Southern Illinois University at Edwardsville. 2014: 57 pages; 1571932.
26.
Black box methods for inferring parallel applications' properties in virtual environments
by Gupta, Ashish, Ph.D.  Northwestern University. 2008: 289 pages; 3303812.
27.
Peer selection algorithm in stochastic content delivery networks to reduce file download time
by Lehrfeld, Michael, Ph.D.  Nova Southeastern University. 2010: 118 pages; 3389939.
28.
A Software Framework for the Detection and Classification of Biological Targets in Bio-Nano Sensing
by Hafeez, Abdul, Ph.D.  Virginia Polytechnic Institute and State University. 2014: 112 pages; 10595350.
29.
A Shifting Bottleneck Procedure with Multiple Objectives in a Complex Manufacturing Environment
by Cayo, Paul, M.S.  Southern Illinois University at Edwardsville. 2017: 72 pages; 10608679.
30.
Model and algorithm for solving real time dial-a-ride problem
by Kim, Taehyeong, Ph.D.  University of Maryland, College Park. 2011: 187 pages; 3478951.
1 - 30 of 21460 displayed.
  1    2    3    4    5    6    7    8    9    10    11   Next >
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest