Browsing by Subject "Algorithms"
Now showing items 1-9 of 9
-
A Scalable Framework for Parallelizing Sampling-Based Motion Planning Algorithms
(2014-04-29)Motion planning is defined as the problem of finding a valid path taking a robot (or any movable object) from a given start configuration to a goal configuration in an environment. While motion planning has its roots in ... -
Assessing the impact of end-member selection on the accuracy of satellite-based spatial variability models for actual evapotranspiration estimation
(American Geophysical Union, 2013) -
Characterizing Structurally Cohesive Clusters in Networks: Theory and Algorithms
(2015-08-05)This dissertation aims at developing generalized network models and solution approaches for studying cluster detection problems that typically arise in networks. More specifically, we consider graph theoretic relaxations ... -
Improving the quality of multiple sequence alignment
(2009-05-15)Multiple sequence alignment is an important bioinformatics problem, with applications in diverse types of biological analysis, such as structure prediction, phylogenetic analysis and critical sites identification. In recent ... -
Models and Solution Approaches for Efficient Design and Operation of Wireless Sensor Networks
(2010-11-11)Recent advancements in sensory devices are presenting various opportunities for widespread applications of wireless sensor networks (WSNs). The most distinguishing characteristic of a WSN is the fact that its sensors have ... -
Network Based Approaches for Clustering and Location Decisions
(2012-10-19)The objective of this dissertation is to study commonly occurring location and clustering problems on graphs. The dissertation is presented as a collection of results in topics including finding maximum cliques in large ... -
Parameterized algorithms and computational lower bounds: a structural approach
(Texas A&M University, 2006-10-30)Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to cope with the NP-hardness of a certain problem. The most popular ... -
Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance
(2015-07-28)The inference of species divergence time is a key step in the study of phylogenetics. Methods have been available for the last ten years to perform the inference, but, there are two significant problems with these methods. ... -
Towards Understanding Relaxations of Distributed Data Structures
(2018-04-04)Since computers are widespread and interconnected, the study of computing has expanded to encompass problems arising from concurrency and the need for coordinated effort between different computing entities. Essential among ...