Search Constraints

Start Over
Filtering by: Creator LeRoy, Charles H. Remove constraint Creator: LeRoy, Charles H. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Topics in toroidal interconnection networks

    Creator:
    Broeg, Robert Richard
    Resource Type:
    Dissertation
    Full Text:
    ) = xn_i koki kn-2 + + xi ko x2kok1 xo = E xi H ki + X 0. i=1 j=0 For example, if 432 is a vector over

  • 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:
    be defined in terms of either a parity check matrix, Hrxn, or a generator matrix G(n_7.),(n. The H

  • Selling and buying in a distributed virtual market place

    Creator:
    Bella, Ravi
    Abstract:
    We present a model for a distributed virtual market place that can be con­structed on the Internet to support selling and buying requests, such as those found as classified advertisements. One requirement for a transaction to take place in the virtual market place is that a sell request and a...
    Resource Type:
    Capstone Project
    Full Text:
    ] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest , Introduction to Algo- rithms, McGraw-Hill

  • 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:
    X Figure 3: (a):3 block floorplan, (b):H-G graph for (a), (c):Search tree for (a) 21 ) to

  • Structured learning with latent variables : theory and algorithms

    Creator:
    Zhao, Kai
    Abstract:
    Most tasks in natural language processing (NLP) try to map structured input (e.g., sentence or word sequence) to some form of structured output (tag sequence, parse tree, semantic graph, translated/paraphrased/compressed sentence), a problem known as “structured prediction”. While various learning algorithms such as the perceptron, maximum entropy, and expectation-maximization have...
    Resource Type:
    Dissertation

  • 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:
    would also like to thank Kim Hall, Professor H. Jo Albers, and Mark Crowley for their collaboration on

  • Leveraging Structures of the Data in Deep Learning

    Creator:
    Li, Xingyi
    Abstract:
    The performance of deep learning frameworks could be significantly improved through considering the particular underlying structures for each dataset. In this thesis, I summarize our three work about boosting the performance of deep learning models through leveraging structures of the data. In the first work, we theoretically justify that, for...
    Resource Type:
    Dissertation

  • Variant Annotation

    Creator:
    He, Jun
    Abstract:
    With the development of technologies in genome sequencing and variant detection, a huge number of variants are detected. To further analyze the variants, it requires an efficient tool to annotate the functional effect of variants. This project managed to develop an efficient program to annotate the functional effect of variants...
    Resource Type:
    Capstone Project
    Full Text:
    format, http://www.ensembl.org/info/website/upload/gff.html 2016. [8] Charles E. Leiserson, Thomas H

  • Investigating Latent State and Uncertainty Representations in Reinforcement Learning

    Creator:
    Koul, Anurag
    Abstract:
    Learning latent space representations of high-dimensional world states has been at the core of recent rapid growth in reinforcement learning(RL). At the same time, RL algo- rithms have suffered from ignored uncertainties in the predicted estimates of model-free or model-based methods. In our work, we investigate both of these aspects...
    Resource Type:
    Dissertation
    Full Text:
    ) HalfCheetah and b) Maze2d-Open. For each PCQ (s, π, ŝ, π̂, h), we plot V π(s, h) vs. V π̂(ŝ, h

  • 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:
    planning problem with initial state s0 and horizon H, we use the planner to generate multiple trajectories