Search
Now showing items 1-10 of 43
Construction and adaptation of AI behaviors in computer games
(Georgia Institute of Technology, 2011-08-19)
Computer games are an increasingly popular application for Artificial Intelligence (AI) research, and conversely AI is an increasingly popular selling point for commercial digital games. AI for non playing characters (NPC) ...
Robust and secure monitoring and attribution of malicious behaviors
(Georgia Institute of Technology, 2011-07-08)
Worldwide computer systems continue to execute malicious software that degrades the systemsâ performance and consumes network capacity by generating high volumes of unwanted traffic. Network-based detectors can effectively ...
Enabling and supporting the debugging of software failures
(Georgia Institute of Technology, 2011-03-21)
This dissertation evaluates the following thesis statement: Program analysis techniques can enable and support the debugging of failures in widely-used applications by (1) capturing, replaying, and, as much as possible, ...
Turing machine algorithms and studies in quasi-randomness
(Georgia Institute of Technology, 2011-11-09)
Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely used in eliminating/reducing the randomness from randomized ...
Mitigating spam using network-level features
(Georgia Institute of Technology, 2011-08-04)
Spam is an increasing menace in email: 90% of email is spam, and over 90% of spam is sent by botnets---networks of compromised computers under the control of miscreants. In this dissertation, we introduce email spam ...
Scaling solutions to Markov Decision Problems
(Georgia Institute of Technology, 2011-11-14)
The Markov Decision Problem (MDP) is a widely applied mathematical model useful for describing a wide array of real world decision problems ranging from navigation to scheduling to robotics. Existing methods for solving ...
Nonnegative matrix and tensor factorizations, least squares problems, and applications
(Georgia Institute of Technology, 2011-11-14)
Nonnegative matrix factorization (NMF) is a useful dimension reduction method that has been investigated and applied in various areas. NMF is considered for high-dimensional data in which each element has a nonnegative ...
Fault propagation analysis of large-scale, networked embedded systems
(Georgia Institute of Technology, 2011-11-16)
In safety-critical, networked embedded systems, it is important that the way in which a fault(s) in one component of the system can propagate throughout the system to other components is analyzed correctly. Many real-world ...
Realizable paths and the NL vs L problem
(Georgia Institute of Technology, 2011-08-29)
A celebrated theorem of Savitch [Savitch'70] states that NSPACE(S) is contained in DSPACE(S²). In particular, Savitch gave a deterministic algorithm to solve ST-Connectivity (an NL-complete problem) using O({log}²{n}) ...
Understanding a large-scale IPTV network via system logs
(Georgia Institute of Technology, 2011-07-08)
Recently, there has been a global trend among the telecommunication industry on the rapid deployment of IPTV (Internet Protocol Television) infrastructure and services. While the industry rushes into the IPTV era, the ...