Search Constraints

Start Over
Filtering by: Creator Keller, C. Remove constraint Creator: Keller, C. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Supporting branch-and-bound computations on parallel machines

    Creator:
    Mannan, Mohammed A.
    Abstract:
    We have developed SearchPak, a machine independent parallel searching tool on shared and distributed memory machines. It can be used for combinatorial optimiza­tion problems and OR-parallel computations as well. Both depth-first and best-first search of the state space can be performed using the SearchPak. With SearchPak, a user just provides...
    Resource Type:
    Capstone Project
    Full Text:
    searching application in con- ventional C code and execute it in parallel on both shared and distributed

  • Machine learning in engineering : techniques to speed up numerical optimization

    Creator:
    Cerbone, G. (Giuseppe)
    Abstract:
    Many important application problems in engineering can be formalized as nonlinear optimization tasks. However, numerical methods for solving such problems are brittle and do not scale well. For example, these methods depend critically on choosing a good starting point from which to perform the optimization search. In high-dimensional spaces, numerical...
    Resource Type:
    Dissertation
    Full Text:
    to share his engineering expertise. Thanks to Tom Dietterich, Peter Friedland, and Rich Keller, I

  • Monte Carlo Tree Search with Fixed and Adaptive Abstractions

    Creator:
    Hostetler, Jesse A.
    Abstract:
    Monte Carlo tree search (MCTS) is a class of online planning algorithms for Markov decision processes (MDPs) and related models that has found success in challenging applications. In the online planning approach, the agent makes a decision in the current state by performing a limited forward search over possible futures...
    Resource Type:
    Dissertation
    Full Text:
    enable more sophisticated solution algorithms. c©Copyright by Jesse A. Hostetler March 20, 2017 All

  • 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:
    localization techniques. c Copyright By Joseph Ronald Ruthruff July 23, 2004 All Rights Reserved

  • Modeling and dynamics analysis of P2P networks based on evolutionary games

    Creator:
    Cho, Seungyun
    Abstract:
    Since free riders in P2P network reduce the system's performance, how to maintain and encourage the nodes' cooperation is an important aspect of P2P related research. In this thesis, a P2P system is modeled based on two games: stag hunt game and snowdrift game. To relate the model to the...
    Resource Type:
    Masters Thesis
    Full Text:
    : Integrating the left side with respect to x and the right side with respect to t gives: where c is

  • Mechanical design under changing customer requirements case study : BugID

    Creator:
    Fagan, Chris R.
    Abstract:
    Customer requirements and engineering specifications will influence the direction of the design in any product, so it is crucial to make the requirements as stable as possible so quality designs can be produced on time within a budget. It would be optimal for requirements and specifications to remain constant but...
    Resource Type:
    Masters Thesis

  • 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:
    Specification C Example run for KRK Problem 190 196 203 List of Figures 1.1 Two similar chess positions

  • Coordination for Scalable Multiple Robot Planning Under Temporal Uncertainty

    Creator:
    Marcon dos Santos, Gilberto
    Abstract:
    This dissertation incorporates coalition formation and probabilistic planning towards a domain-independent automated planning solution scalable to multiple heterogeneous robots in complex domains. The first research direction investigates the effectiveness of Task Fusion and introduces heuristics that improve task allocation and result in better quality plans, while requiring lower computational cost...
    Resource Type:
    Dissertation
    Full Text:
    algorithms. c©Copyright by Gilberto Marcon dos Santos June 8, 2020 All Rights Reserved Coordination

  • Learning and Improving Policies for Probabilistic Planning Problems

    Creator:
    Issakkimuthu, Murugeswari
    Abstract:
    In this work, we study the problem of learning and improving policies for probabilistic planning problems. In the first part, we train neural network policies for probabilistic planning problems modeled as factored Markov decision problems. The objective is to train problem-specific neural networks via supervised learning to imitate the action...
    Resource Type:
    Dissertation
    Full Text:
    variable, i.e., o(z0i ) = xi. Layers 1 through L−1 are hidden layers each containing C×n nodes, where C

  • Incorporating and Learning Behavior Constraints for Sequential Decision Making

    Creator:
    Pinto, Jervis
    Abstract:
    Writing a program that performs well in a complex environment is a challenging task. In such problems, a method of deterministic programming combined with reinforcement learning (RL) can be helpful. However, current systems either force developers to encode knowledge in very specific forms (e.g., state-action features), or assume advanced RL...
    Resource Type:
    Dissertation
    Full Text:
    that learn to perform well. c©Copyright by Jervis Pinto June 12, 2015 All Rights Reserved