Search Constraints

Start Over
Filtering by: Creator Watkins, Steven G. Remove constraint Creator: Watkins, Steven G. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Reinforcement learning for job-shop scheduling

    Creator:
    Zhang, Wei, 1960-
    Resource Type:
    Dissertation
    Full Text:
    Learning for Job-Shop Scheduling Abstract approved: Thomas G. Dietterich This dissertation studies

  • 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:
    Recognition in Desktop Environments Abstract approved: Thomas G. Dietterich Knowledge workers are

  • 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:
    Methods for Reinforcement Learning. Abstract approved: Thomas G Dietterich The thesis focuses on model

  • Simulator-Defined MDP Planning with Applications in Natural Resource Management

    Creator:
    Alkaee Taleghan, Majid
    Abstract:
    This work is inspired by problems in natural resource management centered on the challenge of invasive species. Computing optimal management policies for maintaining ecosystem sustainable is challenging. Many ecosystem management problems can be formulated as MDP (Markov Decision Process) planning problems. In a simulator-defined MDP, the Markovian dynamics and rewards...
    Resource Type:
    Dissertation
    Full Text:
    G. Dietterich This work is inspired by problems in natural resource management centered on the

  • Evaluation functions in aerial image segmentation

    Creator:
    Langford, William T.
    Abstract:
    Remote sensing is the most practical way to acquire large amounts of land cover data for monitoring and understanding environmental change, so it is important to be able to map land cover from imagery. Maps defining land cover patches as polygons rather than pixels greatly improve processing efficiency in models...
    Resource Type:
    Dissertation
    Full Text:
    Abstract approved: Thomas G. Dietterich Warren Cohen Remote sensing is the most practical way to acquire

  • Explanations and Processes to Enable Humans to Assess AI with Respect to Manipulable Properties

    Creator:
    Dodge, Jonathan E.
    Abstract:
    Assessing AI systems is difficult. Humans rely on AI systems in increasing ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools (e.g., a professional auditor, a developer, and an end user all have different needs). We posit that it is possible to provide...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . 159 F Log Appendix - Computing a target tensor with CNN Agent . . . . . . . . 162 G How to

  • 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:
    , a planning problem is a tuple (ω,A, g), where A ⊆ A is a set of actions, ω ∈ W is the initial state

  • 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:
    Adenine (A) prefers to bind with Uracil (U) and Cytosine (C) prefers to bind with Guanine (G). The

  • Investigation of automatic construction of reactive controllers

    Creator:
    Westerberg, Caryl J.
    Abstract:
    In real-time control systems, the value of a control decision depends not only on the correctness of the decision but also on the time when that decision is available. Recent work in real-time decision making has used machine learning techniques to automatically construct reactive controllers, that is, controllers with little...
    Resource Type:
    Masters Thesis
    Full Text:
    and combina- torial circuitry to implement a game playing penguin in Pengi [AC87]. Then, Watkins

  • Reinforcement learning-based off-equilibrium incentives to approximate the VCG mechanism

    Creator:
    Moissinac, Béatrice
    Abstract:
    Auctions are used to solve resource allocation problem between many agents and many items in real-world settings. Unfortunately, in most cases, it is possible for selfish agents to manipulate the system for their own interest at the expense of the social welfare. Such manipulation can be prevented using the Vickrey-Clarke-Groves...
    Resource Type:
    Masters Thesis
    Full Text:
    system objective is the sum of the individual valuations after the game is played. G(geff (Θ̂)) = ∑ i∈N