Search Constraints

Start Over
Filtering by: Creator Cramer, David Alan Remove constraint Creator: Cramer, David Alan Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • UCT for tactical assault battles in real-time strategy games

    Creator:
    Balla, Radha-Krishna
    Abstract:
    We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics...
    Resource Type:
    Masters Thesis
    Full Text:
    Alan Fern We consider the problem of tactical assault planning in real-time strategy games

  • Activity recognition in desktop environments

    Creator:
    Shen, Jianqiang
    Abstract:
    Knowledge workers are struggling in the information flood. There is a growing interest in intelligent desktop environments that help knowledge workers organize their daily life. Intelligent desktop environments allow the desktop user to define a set of “activities” that characterize the user’s desktop work. These environments then attempt to identify...
    Resource Type:
    Dissertation
    Full Text:
    supportive and patient with me during the past 5 years. I would like to thank my committee members, Alan

  • Ensemble Monte-Carlo planning : an empirical study

    Creator:
    Lewis, Paul
    Abstract:
    Monte-Carlo planning algorithms such as UCT make decisions at each step by intelligently expanding a single search tree given the available time and then selecting the best root action. Recent work has provided evidence that it can be advantageous to instead construct an ensemble of search trees and make a...
    Resource Type:
    Masters Thesis
    Full Text:
    Planning: An Empirical Study Abstract approved: Alan Fern Monte-Carlo planning algorithms such as UCT

  • Learning ranking functions for efficient search

    Creator:
    Xu, Yuehua
    Abstract:
    This dissertation explores algorithms for learning ranking functions to efficiently solve search problems, with application to automated planning. Specifically, we consider the frameworks of beam search, greedy search, and randomized search, which all aim to maintain tractability at the cost of not guaranteeing completeness nor optimality. Our learning objective for...
    Resource Type:
    Dissertation
    Full Text:
    : Alan Fern This dissertation explores algorithms for learning ranking functions to efficiently solve

  • Advanced separation of concerns and the compatibility of aspect-orientation

    Creator:
    Dechow, Doug
    Abstract:
    The appropriate separation of concerns is a fundamental engineering principle. A concern, for software developers, is that which must be represented by code in a program; by extension, separation of concerns is the ability to represent a single concern in a single appropriate programming language construct. Advanced separation of concerns...
    Resource Type:
    Dissertation
    Full Text:
    development complexity that Dijkstra describes is notoriously difficult to define. The authors Alan Shalloway

  • Toward computer vision for understanding American football in video

    Creator:
    Hess, Robin W.
    Abstract:
    In this work, I examine the problem of understanding American football in video. In particular, I present several mid-level computer vision algorithms that each accomplish a different sub-task within a larger system for annotating, interpreting, and analyzing collections of American football video. The analysis of football video is useful in...
    Resource Type:
    Dissertation
    Full Text:
    Vision for Understanding American Football in Video Abstract approved: Alan P. Fern In this work, I

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    dissertation has been done with the collaboration of Alan Fern which was a great experience for me. I would

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation

  • Machine learning for improving the quality of citizen science data

    Creator:
    Yu, Jun
    Abstract:
    Citizen Science is a paradigm in which volunteers from the general public participate in scientific studies, often by performing data collection. This paradigm is especially useful if the scope of the study is too broad to be performed by a limited number of trained scientists. Although citizen scientists can contribute...
    Resource Type:
    Dissertation
    Full Text:
    Corvallis was home even I was away from my family. • I would like to thank my committee members: Alan Fern

  • New learning modes for sequential decision making

    Creator:
    Judah, Kshitij
    Abstract:
    This thesis considers the problem in which a teacher is interested in teaching action policies to computer agents for sequential decision making. The vast majority of policy learning algorithms o er teachers little flexibility in how policies are taught. In particular, one of two learning modes is typically considered: 1)...
    Resource Type:
    Dissertation
    Full Text:
    Modes for Sequential Decision Making Abstract approved: Alan P. Fern This thesis considers the