Search Constraints

Start Over
Filtering by: Creator Gamroth, M. J. (Michael J.) Remove constraint Creator: Gamroth, M. J. (Michael J.) Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Non-Academic Affiliation Oregon State University. Graduate School Remove constraint Non-Academic Affiliation: Oregon State University. Graduate School

Search Results

  • Physical activity recognition of free-living data using change-point detection algorithms and hidden Markov models

    Creator:
    Anderson, Michael M.
    Abstract:
    Physical activity recognition using accelerometer data is a rapidly emerging field with many real-world applications. Much of the previous work in this area has assumed that the accelerometer data has already been segmented into pure activities, and the activity recognition task has been to classify these segments. In reality, activity...
    Resource Type:
    Masters Thesis
    Full Text:
    Change-Point Detection Algorithms and Hidden Markov Models AN ABSTRACT OF THE THESIS OF Michael M

  • OME : A Framework for Running Spatially Explicit System Dynamics Models

    Creator:
    Wingo, Patrick C.
    Abstract:
    The Open Modeling Environment (OME) is a tool developed to address some known shortcomings in ecological System Dynamics (SD) modeling research. OME provides a common set of methods for interacting directly with spatial information, reducing the need for modelers to create their own methods for doing so. The environment is...
    Resource Type:
    Masters Thesis

  • Learning MDP action models via discrete mixture trees

    Creator:
    Wynkoop, Michael S.
    Abstract:
    This thesis addresses the problem of learning dynamic Bayesian network (DBN) models to support reinforcement learning. It focuses on learning regression tree models of the conditional probability distributions of the DBNs. Existing algorithms presume that the stochasticity in the domain can be modeled as a deterministic function with additive noise....
    Resource Type:
    Masters Thesis
    Full Text:
    OF Michael S. Wynkoop for the degree of Masters of Science in Computer Science presented on June 9

  • D₊₊ : Structural Credit Assignment in Tightly Coupled Multiagent Domains

    Creator:
    Rahmattalabi, Aida
    Abstract:
    Autonomous multiagent teams can be used in complex exploration tasks to both expedite the exploration and improve the efficiency. However, use of multiagent systems presents additional challenges. Specifically, in domains where the agents' actions are tightly coupled, coordinating multiple agents to achieve cooperative behavior at the group level is difficult....
    Resource Type:
    Masters Thesis

  • Interactive fault localization techniques to empower the debugging efforts of end-user programmers

    Creator:
    Ruthruff, Joseph Ronald
    Abstract:
    End users develop more software than any other group of programmers, using software authoring devices such as e-mail filtering editors, by-demonstration macro builders, and spreadsheet environments. Despite this, there has been only a little research on finding ways to help these programmers with the dependability of the software they create....
    Resource Type:
    Masters Thesis
    Full Text:
    : Margaret M. Burnett End users develop more software than any other group of programmers, using software

  • 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
    Full Text:
    this type and a binary vector of length b m with weight b; in a given configuration, if the j-th box

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    Lipschitz Continuity of ∇M ∞ θk J(θk) . . . . . . . . . 199 LIST OF FIGURES Figure Page 2.1 Performance

  • Update programming -- a safe approach to software maintenance

    Creator:
    Ren, Deling
    Abstract:
    Software maintenance accounts for a large portion of the software development cost, particularly the process of updating programs either to adapt for requirement change or to enhance design or efficiency. Currently, program updates are generally performed manually by programmers using text editors. This is an unreliable method because syntax and...
    Resource Type:
    Dissertation
    Full Text:
    &DEN1�581yF;3<1qp@()9,$ c�9,$'5jc=()&)$'9Ý(D*H5N3N1@9;M;?A58(D14*�581�587;$�*;$'?/$/EjH

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    = tj;1 + tj;2 + : : :+ tj;m Then, ei�j = l=1;2;::: ;mX k=1;2;::: ;n tk;l tk;l = ti;k � tj;l 8i

  • Adversarial planning by strategy switching in a real-time strategy game

    Creator:
    King, Brian D.
    Abstract:
    We consider the problem of strategic adversarial planning in a Real-Time Strategy (RTS) game. Strategic adversarial planning is the generation of a network of high-level tasks to satisfy goals while anticipating an adversary's actions. In this thesis we describe an abstract state and action space used for planning in an...
    Resource Type:
    Masters Thesis
    Full Text:
    , t,K) = N,M∑ i,j (θ1pi,j + θ2tj + θ3Ki,1 + ...+ θ2+kKi,k)xi,j Let opponent capacity Cj be the