Search Constraints

Start Over
Filtering by: Creator Russell-Miller, Mary P. Remove constraint Creator: Russell-Miller, Mary P. Academic Affiliation Electrical Engineering and Computer Science Remove constraint Academic Affiliation: Electrical Engineering and Computer Science Degree Level Doctoral Remove constraint Degree Level: Doctoral

Search Results

  • Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers

    Creator:
    Shamaei, Arash
    Abstract:
    Quotient rings of Gaussian and Eisenstein-Jacobi(EJ) integers can be deployed to construct interconnection networks with good topological properties. In this thesis, we propose deadlock-free deterministic and partially adaptive routing algo­rithms for hexagonal networks, one special class of EJ networks. Then we discuss higher dimensional Gaussian networks as an alternative to...
    Resource Type:
    Dissertation
    Full Text:
    Gaussian and Eisenstein-Jacobi Integers Abstract approved: Bella Bose Mary Flahive Quotient rings of

  • Some communication algorithms for Gaussian and Eisenstein-Jacobi networks

    Creator:
    Albader, Bader
    Abstract:
    Interconnection networks play important roles in designing high performance computers. Recently two new classes of interconnection networks based on the concept of Gaussian and Eisenstein-Jacobi integers were introduced. In this research, efficient routing and broadcasting algorithms for these networks are developed. Furthermore, constructing edge disjoint Hamiltonian cycles in Gaussian networks...
    Resource Type:
    Dissertation
    Full Text:
    : _____________________________________________ Bella Bose, Mary Flahive Interconnection networks play an important role in

  • Helping end-user programmers find and fix performance problems in visual code

    Creator:
    Chambers, Chris
    Abstract:
    End-user programmers often struggle to create programs that run quickly and effectively, which can be a major deterrent in completing their tasks as desired. Current research has primarily focused on catching user mistakes, such as errors or misused formulas. However, end users deal with issues other than just correctness. In...
    Resource Type:
    Dissertation
    Full Text:
    Performance Problems in Visual Code Abstract approved: Christopher P. Scaffidi End-user programmers

  • 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:
    Carlo Tree Search with Fixed and Adaptive Abstractions Abstract approved: Thomas G. Dietterich Alan P

  • 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:
    Constraints for Sequential Decision Making Abstract approved: Alan P. Fern Writing a program that performs

  • Channel Estimation, Modulation Techniques and Decoding Algorithms for Hybrid WiFi-FSO (WiFO) WLAN of Femtocells

    Creator:
    Chu, Yu-Jung
    Abstract:
    Due to the limitation of the radio frequency (RF) spectrum, it is increasingly more difficult to support billions of wireless devices in the age of Internet-of-Things. Consequently, many recent wireless indoor communication systems have been developed using free space optical (FSO) communication technologies that exploit the extremely large light spectrum...
    Resource Type:
    Dissertation
    Full Text:
    Abstract approved: Thinh P. Nguyen Due to the limitation of the radio frequency (RF) spectrum, it is

  • New learning modes for sequential decision making

    Creator:
    Judah, Kshitij
    Abstract:
    This thesis considers the problem in which a teacher is interested in teaching action policies to computer agents for sequential decision making. The vast majority of policy learning algorithms o er teachers little flexibility in how policies are taught. In particular, one of two learning modes is typically considered: 1)...
    Resource Type:
    Dissertation
    Full Text:
    Modes for Sequential Decision Making Abstract approved: Alan P. Fern This thesis considers the

  • 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:
    . Title: Learning and Improving Policies for Probabilistic Planning Problems Abstract approved: Alan P

  • Toward computer vision for understanding American football in video

    Creator:
    Hess, Robin W.
    Abstract:
    In this work, I examine the problem of understanding American football in video. In particular, I present several mid-level computer vision algorithms that each accomplish a different sub-task within a larger system for annotating, interpreting, and analyzing collections of American football video. The analysis of football video is useful in...
    Resource Type:
    Dissertation
    Full Text:
    Vision for Understanding American Football in Video Abstract approved: Alan P. Fern In this work, I

  • Gray codes and their applications

    Creator:
    Anantha, Madhusudhanan
    Abstract:
    An n-bit Gray code is an ordered set of all 2n binary strings of length n. The special property of this listing is that Hamming distance between consecutive vectors is exactly 1. If the last and first codeword also have a Hamming distance 1 then the code is said to...
    Resource Type:
    Dissertation
    Full Text:
    Dr. Mary Flahive, for her valu- able help and guidance and a careful reading of my thesis to improve