Now showing items 1-4 of 4
Algorithmic aspects of connectivity, allocation and design problems
(Georgia Institute of Technology, 2008-05-23)
Most combinatorial optimization problems are NP -hard, which imply that under well- believed complexity assumptions, there exist no polynomial time algorithms to solve them. To cope with the NP-hardness, approximation ...
Some approximation algorithms for multi-agent systems
(Georgia Institute of Technology, 2011-08-29)
This thesis makes a number of contributions to the theory of approximation algorithm design for multi-agent systems. In particular, we focus on two research directions. The first direction is to generalize the classical ...
Performance understanding and tuning of iterative computation using profiling techniques
(Georgia Institute of Technology, 2010-05-18)
Most applications spend a significant amount of time in the iterative parts of a computation. They typically iterate over the same set of operations with different values. These values either depend on inputs or values ...
Enhance the understanding of whole-genome evolution by designing, accelerating and parallelizing phylogenetic algorithms
(Georgia Institute of Technology, 2014-04-07)
The advent of new technology enhance the speed and reduce the cost for sequencing biological data. Making biological sense of this genomic data is a big challenge to the algorithm design as well as the high performance ...