Search Constraints

Start Over
Filtering by: Creator Goldberg, Mark S. Remove constraint Creator: Goldberg, Mark S. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • A General Purpose Agent-Based Blackboard Optimization Method Applied to Sodium Fast Reactor Design and Analysis

    Creator:
    Stewart, Ryan H.
    Abstract:
    We present a novel multi-objective optimization methodology built upon a multi-agent blackboard framework. This multi-agent blackboard system (MABS) synthesizes blackboard architectures, multi-agent environments, and optimization theory. The blackboard architecture creates the framework for initializing, storing, and solving a multi-objective optimization problem. Multiple agents allow for an optimization problem to be...
    Resource Type:
    Dissertation
    Full Text:
    Abstract approved: Todd S. Palmer We present a novel multi-objective optimization methodology built upon

  • Correct abstraction in counter-planning : a knowledge compilation approach

    Creator:
    Flann, Nicholas S.
    Abstract:
    Knowledge compilation improves search-intensive problem-solvers that are easily specified but inefficient. One promising approach improves efficiency by constructing a database of problem-instance/best-action pairs that replace problem-solving search with efficient lookup. The database is constructed by reverse enumeration- expanding the complete search space backwards, from the terminal problem instances. This approach...
    Resource Type:
    Dissertation
    Full Text:
    compilation approach AN ABSTRACT OF THE THESIS OF Nicholas S. Flann for the degree of Doctor of Philosophy

  • 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:
    - mark problem. 2.1.2 GrowSupport, Rout, and BFBP Consider a deterministic, episodic MDP. Let s′ = a(s

  • Parsing with Recurrent Neural Networks

    Creator:
    Cross, James Henry, III
    Abstract:
    Machine learning models for natural language processing have traditionally relied on large numbers of discrete features, built up from atomic categories such as word forms and part-of-speech labels, which are considered completely distinct from each other. Recently however, the advent of dense feature representations coupled with deep learning techniques has...
    Resource Type:
    Dissertation
    Full Text:
    -standard dependency parsing system [42]. Stack S is a list of heads, j is the start index of the queue, and

  • Re-understanding Finite-State Representations of Recurrent Policy Networks

    Creator:
    Danesh, Mohamad H.
    Abstract:
    We propose an approach for understanding control policies represented as recurrent neural networks. Recent work has approached this problem by transforming such recurrent policy networks into finite-state machines (FSM) and then analyzing the equivalent minimized FSM. While this led to interesting insights, the minimization process can obscure a deeper understanding...
    Resource Type:
    Masters Thesis
    Full Text:
    the game playing behavior. It is straightforward for a human to mark the time when this warm-up

  • Designing and understanding information retrieval systems using collaborative filtering in an academic library environment

    Creator:
    Jung, Seikyung
    Abstract:
    Accessing information on the Web has become ingrained into our daily lives, and we seek information from many different sources, including conference and journal publications, personal web pages, and others. Increasingly, web-based information retrieval systems such as web-based search engines, library on-line catalog systems, and subscription-based federated search systems are...
    Resource Type:
    Dissertation
    Full Text:
    : explicitly or implicitly. Retrieval systems that collect explicit feedback ask users to mark documents in

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    ) label scores of the resulting span: ξ = maxX s(j, j+1, X) and σ = maxX s(k, j,X) where X is a

  • Learning greedy policies for the easy-first framework

    Creator:
    Xie, Jun
    Abstract:
    Easy-first, a search-based structured prediction approach, has been applied to many NLP tasks including dependency parsing and coreference resolution. This approach employs a learned greedy policy (action scoring function) to make easy decisions first, which constrains the remaining decisions and makes them easier. This thesis studies the problem of learning...
    Resource Type:
    Masters Thesis
    Full Text:
    . More recently, Goldberg and Elhadad [15] formally introduced the Easy-first framework and applied it

  • Reinforcement learning for job-shop scheduling

    Creator:
    Zhang, Wei, 1960-
    Resource Type:
    Dissertation
    Full Text:
    Methods vs. AI Methods Starting in the 1950's operations researchers began advocating formal optimization

  • Optimization of seasonal irrigation scheduling by genetic algorithms

    Creator:
    Canpolat, Necati
    Abstract:
    In this work, we first introduce a novel approach to the long term irrigation scheduling using Genetic Algorithms (GAs). We explore the effectiveness of GAs in the context of optimizing nonlinear crop models and describe application requirements and implementation of the technique. GAs were found to converge quickly to near-optimal...
    Resource Type:
    Dissertation
    Full Text:
    ), Goldberg (1989), and Mitchell (1996). GAs draw their power from genetic operators. Three main operators