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 632 for “"running time"”.
-
Dissociation, Association and Running Time
… strategies for coping with the discomfort of running and running performance. Subjects were volunteers enrolled in two Dynamic Fitness classes which were taught during Spring Quarter, 1980, at Utah State University. Class A consisted of 36 subjects (24 male, 12 female) and Class B consisted of …
-
Quadratic programming : quantitative analysis and polynomial running time algorithms
Many problems in economics, statistics and numerical analysis can be formulated as the optimization of a convex quadratic function over a polyhedral set. A polynomial algorithm for solving convex quadratic programming problems was first developed by Kozlov at al. (1979). Tardos (1986) was the first …
-
The effect of quadriceps development on sprint running time
Thesis (M.A.)--Michigan State University of Agriculture and Applied Science. Dept. of Health, Physical Education, and Recreation, 1955
-
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
-
Method to reduce computer running time for the integer programming lockbox problem, A
Includes bibliographical references.
-
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 …
-
Empirical analysis of the reliability of a bus route with several time points
… of a bus route. It was found that, at the time point level, the amount of the slack time inserted into the route is always the key method in recovering reliability. The number and locations of the time points also play a significant role in impacting bus service reliability. Several …
-
Parametric analysis for ungapped Markov models of evolution
… values of the evolutionary distance. The running time of these algorithms are comparable to the running time of the algorithms for a fixed parameter value. The running time for the parametric ancestral reconstruction problem under the Kimura 2-parameter model is O(kn + kn[superscript 2/3] …
-
Serotonin and exercise
… with lowered 5-HT levels had a 30% increase in running time to exhaustion whereas their controls only had a 1% increase. Elevating 5-HT levels decreased running time 44% whereas appropiate controls had a 7% increase in running time. In some animals the effect of exercise on 5-HT levels in the …
-
An Experimental Study of Distance Sensitivity Oracles
… with any given single failure in constant time without reconstructing the oracle. Using their paper as a guideline, we have implemented their algorithm in C++ and recorded each step in this thesis. Each step has its own pseudo-code and its own analysis to prove that the entire oracle …
-
Balancing Branching and Pathwidth: Threshold-Based Approaches for Exponential Algorithms
We consider exponential-time algorithms for NP-hard problems that combine a pathwidth-based approach and a branching approach. In this context, we investigate how a running time analysis can decide thresholds to balance the two methods, thereby improving the running times for such NP-hard problems. …
-
Extracting Surface Structural Information from Vibrational Spectra with Linear Programming
… details to match the experimental spectra. The running time for the exhaustive approach is O(n!). With the help of linear programming, the running time is pseudo O(n). The linear programming approach is with out a doubt far more superior than exhaustive approach in terms of running time. We …
-
Approximately Counting Perfect and General Matchings in Bipartite and General Graphs
… for the permanent. It has a polynomial expected running time for a class of dense problems, and it gives an improvement in running time by a factor of $n^3$ for matrices that are (.6)-dense. </p><p>Next, we apply the similar approach to study perfect matchings in nonbipartite graphs and also …
-
Improving the Numerical Efficiency of a High Accuracy Shell Element for Soft Tissues
… also known to feature efficiently large critical time steps, ensuring competitive computational times in dynamic structural analysis projects. As an improvement to the tools available for modelling and analysis, a new general nonlinear thick continuum-based (CB) shell FE embedded in an updated …
-
Efficient finite field arithmetic with cryptographic applications
… However, it is also one of the most time consuming operations in both software and hardware, which makes it pertinent to develop a fast and efficient implementation. We propose four improved FPGA multiplication implementations using the Karatsuba and Fast Fourier Transform algorithms …
-
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 …
-
Make OS Independent Software: A Bare-PC Build Tool X86 PCs
… OS overhead is a pure waste during both booting time and running time. Thus OS independent applications are more efficient in such a case. There are applications written to run on bare PC, and there is also research to convert ordinary OS based application to bare PC-based ones. However, there is …
-
An Asymptotically Optimal Implementation of Product Structure Theorem for Planar Graphs
… for implementing such a factorization had a running time of O(n log n), limiting its use in practice. In this thesis, we present the first implementation of the O(n) running time algorithm for planar graph factorization. In doing so, we clarify several ambiguities present in the original …
-
Heads Above the Rest: Examining Head impacts in Canadian High School Football
… The third manuscript evaluated a score-based running time rule. Objective: To describe the effect of the score-based running time rule on the rates of head impacts in Canadian high school football. Methods: Video analysis was used to identify head impacts in games (n=14) involving two teams …
Page 1 of 32