Results

Looking for more? ProQuest® Dissertations & Theses has additional dissertations and theses.
11434 open access dissertations and theses found for:
if(Approximation algorithms)  »   Refine Search
1.
Sensor Coverage and Actors Relocation in Wireless Sensor and Actor Networks (WSAN): Optimization Models and Approximation Algorithms
by Nagilla, Praveen K., M.S.  University of Missouri - Columbia. 2010: 74 pages; 13849580.
2.
A class of staggered grid algorithms and analysis for time-domain Maxwell systems
by Charlesworth, Alexander E., M.S.  Colorado School of Mines. 2016: 91 pages; 10010857.
3.
Network Design With Facility Location: Approximation and Exact Techniques
by Rezapour, Mohsen, Dr.Nat.  Technische Universitaet Berlin (Germany). 2015: 133 pages; 10701438.
4.
Approximation of Positive Semidefinite Matrices Using the Nyström Method
by Arcolano, Nicholas Francis, Ph.D.  Harvard University. 2011: 247 pages; 3462777.
5.
Graph diffusions and matrix functions: Fast algorithms and localization results
by Kloster, Kyle, Ph.D.  Purdue University. 2016: 114 pages; 10149739.
6.
Applications of the Minimum Sobolev Norm and Associated Fast Algorithms
by Gorman, Christopher Henry, Ph.D.  University of California, Santa Barbara. 2019: 220 pages; 13896728.
8.
Bicubic L1 Spline Fits for 3D Data Approximation
by Zaman, Muhammad Adib Uz, M.S.  Northern Illinois University. 2018: 75 pages; 10751900.
9.
Efficient algorithms for phylogenetic post-analysis
by Pattengale, Nicholas Dylan, Ph.D.  The University of New Mexico. 2010: 131 pages; 3409376.
10.
Efficient image restoration algorithms for near-circulant systems
by Pan, Ruimin, Ph.D.  Auburn University. 2007: 130 pages; 3265586.
11.
Near-optimality and robustness of greedy algorithms for Bayesian pool-based active learning
by Cuong, Nguyen Viet, Ph.D.  National University of Singapore (Singapore). 2015: 124 pages; 10006066.
12.
Efficient inference algorithms for near-deterministic systems
by Chatterjee, Shaunak, Ph.D.  University of California, Berkeley. 2013: 130 pages; 3616611.
13.
A Study of the Errors of the Fixed-Node Approximation in Diffusion Monte Carlo
by Rasch, Kevin M., Ph.D.  North Carolina State University. 2012: 172 pages; 3538537.
14.
Quantum virial coefficients via path integral Monte Carlo: Theory and development of novel algorithms
by Subramanian, Ramachandran, Ph.D.  State University of New York at Buffalo. 2016: 268 pages; 10127734.
16.
Particle filtering for stochastic control and global optimization
by Zhou, Enlu, Ph.D.  University of Maryland, College Park. 2009: 138 pages; 3372999.
17.
Combinatorial problems in online advertising
by Malekian, Azarakhsh, Ph.D.  University of Maryland, College Park. 2009: 110 pages; 3391381.
18.
Optimizing task assignment for collaborative computing over heterogeneous network devices
by Kao, Yi-Hsuan, Ph.D.  University of Southern California. 2016: 185 pages; 10124490.
19.
Methods for improving the design and performance of evolutionary algorithms
by Bassett, Jeffrey K., Ph.D.  George Mason University. 2012: 159 pages; 3549855.
20.
Latent Variable Modeling for Networks and Text: Algorithms, Models and Evaluation Techniques
by Foulds, James Richard, Ph.D.  University of California, Irvine. 2014: 287 pages; 3631094.
22.
Primal-dual interior-point algorithms for linear programs with many inequality constraints
by Winternitz, Luke Michael Blohm, Ph.D.  University of Maryland, College Park. 2010: 273 pages; 3409883.
23.
Algorithmic approaches to reducing resource costs in data centers
by Mukherjee, Koyel, Ph.D.  University of Maryland, College Park. 2013: 210 pages; 3612196.
25.
Novel Function Approximation Techniques for Large-scale Reinforcement Learning
by Wu, Cheng, Ph.D.  Northeastern University. 2010: 130 pages; 3443846.
26.
Algorithms for Tracking in Clutter and for Sensor Registration
by Crouse, David Frederic, Ph.D.  University of Connecticut. 2011: 313 pages; 3485265.
27.
28.
Probabilistic and topological methods in computational geometry
by Dhandapani, Raghavan S., Ph.D.  New York University. 2010: 122 pages; 3396723.
29.
Planning under uncertainty: From informative path planning to partially observable semi-MDPs
by Wei, Lim Zhan, Ph.D.  National University of Singapore (Singapore). 2015: 148 pages; 10006047.
1 - 30 of 11434 displayed.
  1    2    3    4    5    6    7    8    9    10    11   Next >
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest