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 25 for “"analysis of algorithms"”.
-
Analysis of algorithms to create profitable trades in the stock market
… to handle unexpected events. This paper analyzes algorithms that are based on human psychology instead of just looking for patterns in the data. It also attempts to find optimal parameters for the algorithms and see if their performance will persist in the future and with trading costs. Finally, …
-
Analysis of Algorithms for Finding All Spanning Trees of a Graph
… in DSpace on 2014-12-10T20:13:26Z (GMT). No. of bitstreams: 1 7114697.pdf: 2464146 bytes, checksum: 68120445ae87a9d8e5b5bd8ef7521b26 (MD5) Previous issue date: 1970
-
Facility location and the analysis of algorithms through factor-revealing programs
… location problem (UFLP), we are given a set of clients, a set of facilities, an opening cost for each facility, and a connection cost between each client and each facility satisfying the metric inequality. The objective is to open a subset of facilities and connect each client to an open …
-
Design and analysis of algorithms for similarity search based on intrinsic dimension
One of the most fundamental operations employed in data mining tasks such as classification, cluster analysis, and anomaly detection, is that of similarity search. It has been used in numerous fields of application such as multimedia, information retrieval, recommender systems and pattern …
-
Exploratory analysis of algorithms for fair and efficient allocation of indivisible chores
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms
-
Comparative analysis of algorithms for identifying copy number variation in array CGH data
The aim of the study is comparative analysis of algorithms for identifying copy number variation in array CGH data. Circular Binary segmentation (CBS), CGH segmentation, Price —Smith—Waterman algorithm (the three algorithms are a part of ADaCGH tool) and Cluster Along Chromosome (CLAC) which is not …
-
Performance Analysis of Algorithms for Supporting Disconnected Write Operations in Wireless Web Environments
… model which helps identify the optimal length of the disconnection period under which the cost of update propagation is minimized. We validate the analytic model with simulation in the thesis. We also show how the result can be applied to real-time web applications with a deadline requirement …
-
Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems
The k–server problem is of significant importance to the theoretical computer science and the operations research community. In this problem, we are given k servers, their initial locations and a sequence of n requests that arrive one at a time. All these locations are points from some metric space …
-
Design and Analysis of Algorithms for Efficient Location and Service Management in Mobile Wireless Systems
… new challenges to the design and validation of system supports for facilitating development of mobile applications. This dissertation concerns two major system-support mechanisms in mobile wireless networks, namely, location management and service management. We address this research issue by …
-
Learning-Augmented Algorithms
Traditional worst case analysis of algorithms does not fully capture real world behavior in many instances. Inspired by the great success of machine learning algorithms for various practical tasks, there has been recent interest in moving beyond pessimistic analysis of algorithms through the use of …
-
The extreme point mathematical programming problem
This dissertation deals with a class of nonconvex mathematical programs called Extreme Point Mathematical Programs (EPMP). These problems are generalizations of certain Integer Programming problems and also find their application in other nonconvex programs like the Concave Minimization problem. …
-
Learning Algorithms for Mixtures of Linear Dynamical Systems: A Practical Approach
In this work, we give the first implementation of an algorithm to learn a mixture of linear dynamical systems (LDS’s), and an analysis of algorithms to learn a single linear dynamical system. Following the work of Bakshi et al. ([1]), we implement a recent polynomial-time algorithm based on a …
-
Fast geometric algorithms
This thesis addresses a number of important problems which fall within the framework of the new discipline of Computational Geometry. The list of topics covered includes sorting and selection, convex hull algorithms, the L₁ hull, determination of the minimum encasing rectangle of a set of points, …
-
Predicting human behavior using visual media
… to medicine. In this thesis, I focus on the use of visual media such as images and videos to predict human behavior. Can we predict what images people remember or forget? Can we predict the type of images people will like? Can we use a photograph of someone to determine their state of mind? These …
-
Smoothed Online Learning: Theory and Applications
Many of the algorithms and theoretical results surrounding modern machine learning are predicated on the assumption that data are independent and identically distributed. Motivated by the numerous applications that do not satisfy this assumption, many researchers have been interested in relaxations …
-
Limit Laws for Random Recursive Structures and Algorithms
Es werden Parameter zufälliger rekusiver Strukturen und Algorithmen <br>asymptotisch untersucht. Insbesondere sind dies die Kosten für partielle <br>Bereichssuchen in schlüsselvergleichsbasierten Datenstrukturen, die interne <br>Pfadlänge in zufälligen Suchbäumen, die Laufzeit des Findalgorithmus, …
-
Distributed averaging in dynamic networks
The question of computing average of numbers present at nodes in a network in a distributed manner using gossip or message-passing algorithms has been of great recent interest across disciplines -- algorithms, control and robotics, estimation, social networks, etc. It has served as a non-trivial, …
-
DISTRIBUTED COMPUTING BY MOBILE ROBOTS: COMPUTATIONAL POWER AND ALGORITHM DESIGN
… used to formalize and study distributed systems of mobile autonomous robots, namely swarms of robots. Generally, the LCM model assumes robots are anonymous, indistinguishable, homogeneous, and punctiform entities acting on the Euclidean plane through LCM cycles. Other features may limit robots' …
-
Analysis and Implementation of Algorithms for Noncommutative Algebra
A fundamental task of algebraists is to classify algebraic structures. For example, the classification of finite groups has been widely studied and has benefited from the use of computational tools. Advances in computer power have allowed researchers to attack problems never possible before. In …
-
Signal Acquisition and Tracking for a Software Gps Receiver
… user flexibility. Thus, it is necessary to have Software-based GPS receivers for easy and quick implementation, simulation and analysis of algorithms. Software-based GPS receiver processes the GPS signal at the radio frequency or intermediate frequency depending on the hardware configuration of …
Page 1 of 2