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 206 for “"running time"”.
-
Foundational Verification of Running-Time Bounds for Interactive Programs
… express very precise specifications. It is sometimes desirable to prove properties about programs that make reference to not just semantic behavior but also to other metaproperties of the program’s execution, such as runtime or I/O histories. There is also a wide variety of existing tooling for …
-
Minimum Mean Running Time Function Generation Using Read Only Memory
Made available in DSpace on 2014-12-13T18:02:10Z (GMT). No. of bitstreams: 1 7915350.pdf: 5885526 bytes, checksum: 55221186176e6f6751b4f952e78b68e9 (MD5) Previous issue date: 1979
-
Optimal planning of running time improvements for mixed-use freight and passenger railway lines
In recent years, the United States has seen a renewed focus on developing improved intercity passenger railway lines and services. With the political sensitivity of public investment in rail infrastructure and accompanying shortage of state and federal funds, it is important that the most cost …
-
Running time variability and resource allocation : a data-driven analysis of high-frequency bus operations
Running time variability is one of the most important factors determining service quality and operating cost of high-frequency bus transit. This research aims to improve performance analysis tools currently used in the bus transit industry, particularly for measuring running time variability and …
-
Network assisted file system consistency checking
… disk space to store temporary files, but sometimes insufficient disk space is available, and NFSCK cannot be used. NAN allows NFSCK to use an NFS server to store these temporary files. Tests were run to compare the total running time of NAN and NFSCK on various machines and data sets. Results …
-
Iterative methods, combinatorial optimization, and linear programming beyond the universal barrier
… how to improve upon the best known theoretical running times for solving these problems across a broad range of parameters. Using and improving techniques from diverse disciplines including spectral graph theory, numerical analysis, data structures, and convex optimization we provide the first …
-
Spatial search by quantum walk with a randomized local start state
… delocalized one. We analytically calculate the running time of our algorithm on the complete graph and find it to be O([square root]N). We reduce the analysis of our algorithm to that of the Childs and Goldstone algorithm by comparing the eigenvalue conditions of the Hamiltonians used in the two …
-
Smaller steps for faster algorithms : a new approach to solving linear systems
… study iterative algorithms with simple sublinear time update steps, and we show how a mix of of data structures, randomization, and results from numerical analysis allow us to achieve faster algorithms for solving linear systems in a variety of different regimes. First we present a simple …
-
Fast program for sequence alignment using partition function posterior probabilities
… of both proteins and nucleotides. However, the time for execution is fairly high. The focus is therefore, to reduce the running time of the existing version of Probalign, maintaining its current accuracy level. The thesis conducts a detail analysis of the performance of Probalign to bring down …
-
Accelerating MOEA Non-dominated Sorting by Preserving Archival Relationships
… it can contribute significantly to the running time of an MOEA. If the population size is sufficiently large, the time spent sorting the population can come to dominate an MOEA's running time.;The non-dominated sorting algorithms in the literature propose optimizations that focus on …
-
Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems
… guarantees on approximation quality and running time. We analyze the bit complexity and stability of efficient algorithms for problems including linear regression, $p$-norm regression, and linear programming by showing that a common subroutine, inverse maintenance, is backward stable and …
-
Bounds on multithreaded computations by work stealing
… computation on P processors in expected time [mathematical formula], where T denotes the minimum serial execution time of the multithreaded computation, and T. denotes the minimum execution time with an infinite number of processors. This thesis extends the existing literature in two …
-
Information theoretic bounds for distributed computation
… how does the communication network impact the time until the performance criterion is guaranteed. Using Information Theoretic inequalities, I derive an algorithm-independent lower bound on the computation time. The bound is a function of the uncertainty in the function to be estimated, via its …
-
Matchings, matroids and submodular functions
… graphs. Our algorithm requires O(n") time in graphs with n vertices, where w < 2.38 is the matrix multiplication exponent. This algorithm achieves the best-known running time for dense graphs, and it resolves an open question of Mucha and Sankowski (2004). For the matroid intersection …
-
Robust algorithms for model-based object recognition and localization
… very accurately in an unacceptable worst case running time, or may have unreliable output when noise is allowed. We introduce the idea of tolerance which measures the robustness of a recognition and localization method when noise is allowed. We present a collection of algorithms for the …
-
An approximate dynamic programming approach to discrete optimization
… benchmarks for comparison are solution quality, running time and robustness (i.e., small deviations in the computational resources such as running time for varying instances of same size). In this thesis, we particularly focus on knapsack problems and the binary integer programming problem. We …
-
Optimization of multiple investments with risk analysis
… risk analysis and with a short computer running time. Significant features of the analysis technique include: (1) A general and flexible computer model which can easily be applied to a wide range of capital investment decisions, (2) The use of present value for a consistent and realistic …
-
Faster algorithms for convex and combinatorial optimization
… We obtain the first improvement to the running time for linear programming in 25 years. The convergence rate of this randomized algorithm nearly matches the universal barrier for interior point methods. As a corollary, we obtain the first ... time randomized algorithm for solving the …
-
Verification of advanced controllers for safety-critical systems
… decomposition come with a downside of high running time when applied to more complex systems with more parameters. This, in some cases, limits the complexity of the system that we could consider. Therefore, we focused our attention on control problems such as obtaining an explicit MPC law …
-
Pricing European options using Monte Carlo methods
… for a GPU. I also optimize them to reduce their running time. Finally I compare the performance of those two programs.
Page 1 of 11