Search Constraints

Start Over
Filtering by: Creator Ulrich, Dale A. Remove constraint Creator: Ulrich, Dale A. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • 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:
    networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost

  • 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
    Full Text:
    make the requirements as stable as possible so quality designs can be produced on time within a

  • 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:
    is to induce a linear ranking function for guiding the search that performs nearly as well as

  • 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:
    typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms

  • 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:
    AN ABSTRACT OF THE DISSERTATION OF Jesse A. Hostetler for

  • Adaptive Multiagent Traffic Management for Autonomous Robotic Systems

    Creator:
    Rebhuhn, Carrie
    Abstract:
    There is growing commercial interest in the use of unmanned aerial vehicles (UAVs) in urban environments, specifically for package delivery applications. However, the size, complexity and sheer numbers of expected UAVs makes conventional air traffic management that relies on human air traffic controllers infeasible. To enable UAVs to safely and...
    Resource Type:
    Dissertation
    Full Text:
    environments, it is essential to develop autonomous UAV management strategies. We introduce a dynamic

  • Representationally Robust and Scalable Learning over Relational Databases

    Creator:
    Picado Leiva, Jose Manuel
    Abstract:
    Learning novel concepts from relational databases is an important problem with applications in several disciplines, such as data management, natural language processing, and bioinformatics. For a learning algorithm to be effective, the input data should be clean and in some desired representation. However, real-world data is usually heterogeneous – the...
    Resource Type:
    Dissertation
    Full Text:
    disciplines, such as data management, natural language processing, and bioinformatics. For a learning

  • Computing Resource Usage as a Factor of Student Success

    Creator:
    Moissinac, Béatrice
    Abstract:
    Learning Analytics and other branches of Educational Research such as Computing Education Research (CER) implicitly assume that students, especially college students, have no barriers to access learning platforms or software packages. This assumption may be attributed to such pervasive beliefs such as "everyone has a device", or "everyone can access...
    Resource Type:
    Dissertation
    Full Text:
    : Computing Resource Usage as a Factor of Student Success Abstract approved: Jennifer Parham-Mocello Robin B

  • 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:
    : Coordination for Scalable Multiple Robot Planning Under Temporal Uncertainty Abstract approved: Julie A

  • Variational Satisfiability Solving

    Creator:
    Young, Jeffrey M.
    Abstract:
    Over the last two decades, satisfiability and satisfiability-modulo theory (SAT/SMT) solvers have grown powerful enough to be general purpose reasoning engines throughout software engineering and computer science. However, most practical use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of related SAT/SMT problems....
    Resource Type:
    Dissertation
    Full Text:
    use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of