Now showing items 1-20 of 354

    • Accelerating microarchitectural simulation via statistical sampling principles 

      Bryan, Paul David (Georgia Institute of Technology, 2012-12-05)
      The design and evaluation of computer systems rely heavily upon simulation. Simulation is also a major bottleneck in the iterative design process. Applications that may be executed natively on physical systems in a matter ...
    • Acoustical Awareness for Intelligent Robotic Action 

      Martinson, Eric Beowulf (Georgia Institute of Technology, 2007-11-12)
      With the growth of successes in pattern recognition and signal processing, mobile robot applications today are increasingly equipping their hardware with microphones to improve the set of available sensory information. ...
    • Adaptable Protocol Stack for Future Sensor Networks 

      Kumar, Rajnish (Georgia Institute of Technology, 2006-08-28)
      The goal of this thesis is to provide an adaptable protocol stack architecture for data fusion applications. Towards the goal, this thesis presents the design of SensorStack, that addresses three key issues. First, ...
    • Algorithmic aspects of connectivity, allocation and design problems 

      Chakrabarty, Deeparnab (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 ...
    • Algorithmic Aspects of the Internet 

      Saberi, Amin (Georgia Institute of Technology, 2004-07-12)
      The goal of this thesis is to use and advance the techniques developed in the field of exact and approximation algorithms for many of the problems arising in the context of the Internet. We will formalize the method of ...
    • Algorithmic Game Theory 

      Mehta, Aranyak (Georgia Institute of Technology, 2005-07-19)
      The interaction of theoretical computer science with game theory and economics has resulted in the emergence of two very interesting research directions. First, it has provided a new model for algorithm design, which ...
    • Algorithmic performance of large-scale distributed networks: A spectral method approach 

      Gkantsidis, Christos (Georgia Institute of Technology, 2005-12-09)
      Complex networks like the Internet, peer-to-peer systems, and emerging sensor and ad-hoc networks are large distributed decentralized communication systems arising repeatedly in today's technology. In such networks it is ...
    • Algorithms and mechanism design for multi-agent systems 

      Karande, Chinmay (Georgia Institute of Technology, 2010-09-17)
      A scenario where multiple entities interact with a common environment to achieve individual and common goals either co-operatively or competitively can be classified as a Multi-Agent System. In this thesis, we concentrate ...
    • Algorithms for budgeted auctions and multi-agent covering problems 

      Goel, Gagan (Georgia Institute of Technology, 2009-07-07)
      In this thesis, we do an algorithmic study of optimization problems in budgeted auctions, and some well known covering problems in the multi-agent setting. We give new results for the design of approximation algorithms, ...
    • Algorithms for large graphs 

      Das Sarma, Atish (Georgia Institute of Technology, 2010-07-01)
    • Allocation problems with partial information 

      Tripathi, Pushkar (Georgia Institute of Technology, 2012-06-28)
      Allocation problems have been central to the development of the theory of algorithms and also find applications in several realms of computer science and economics. In this thesis we initiate a systematic study of these ...
    • Analysis and Design of Vehicular Networks 

      Wu, Hao (Georgia Institute of Technology, 2005-11-18)
      Advances in computing and wireless communication technologies have increased interest in smart vehicles, vehicles equipped with significant computing, communication and sensing capabilities to provide services to travelers. ...
    • Analysis of the subsequence composition of biosequences 

      Cunial, Fabio (Georgia Institute of Technology, 2012-05-07)
      Measuring the amount of information and of shared information in biological strings, as well as relating information to structure, function and evolution, are fundamental computational problems in the post-genomic era. ...
    • Analyzing Cross-layer Interaction in Overlay Networks 

      Seetharaman, Srinivasan (Georgia Institute of Technology, 2007-11-14)
      Overlay networks have recently gained popularity as a viable alternative to overcome functionality limitations of the Internet (e.g., lack of QoS, multicast routing). They offer enhanced functionality to end-users by forming ...
    • Analyzing the Conceptual Integrity of Computing Applications Through Ontological Excavation and Analysis 

      Hsi, Idris (Georgia Institute of Technology, 2005-07-19)
      In the world of commercial computing, consumers are being inundated with baroque, bloated, and difficult-to-use computing applications, tools that use computational methods and technologies to perform tasks. Market forces ...
    • Animating physical phenomena with embedded surface meshes 

      Wojtan, Chris (Georgia Institute of Technology, 2010-11-17)
      Accurate computational representations of highly deformable surfaces are indispensable in the fields of computer animation, medical simulation, computer vision, digital modeling, and computational physics. The focus of ...
    • Annealing and Tempering for Sampling and Counting 

      Bhatnagar, Nayantara (Georgia Institute of Technology, 2007-07-09)
      The Markov Chain Monte Carlo (MCMC) method has been widely used in practice since the 1950's in areas such as biology, statistics, and physics. However, it is only in the last few decades that powerful techniques for ...
    • Application acceleration for wireless and mobile data networks 

      Zhuang, Zhenyun (Georgia Institute of Technology, 2010-08-27)
      This work studies application acceleration for wireless and mobile data networks. The problem of accelerating application can be addressed along multiple dimensions. The first dimension is advanced network protocol design, ...
    • Applying inter-layer conflict resolution to hybrid robot control architectures 

      Powers, Matthew D. (Georgia Institute of Technology, 2010-01-20)
      In this document, we propose and examine the novel use of a learning mechanism between the reactive and deliberative layers of a hybrid robot control architecture. Balancing the need to achieve complex goals and meet ...
    • Approximate edge 3-coloring of cubic graphs 

      Gajewar, Amita Surendra (Georgia Institute of Technology, 2008-07-10)
      The work in this thesis can be divided into two different parts. In the first part, we suggest an approximate edge 3-coloring polynomial time algorithm for cubic graphs. For any cubic graph with n vertices, using this ...