Search Constraints

Start Over
Filtering by: Creator Schnier, Kurt E. Remove constraint Creator: Schnier, Kurt E. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Knowledge Base Completion Leveraging Natural Language Data

    Creator:
    Shahbazi, Hamed
    Abstract:
    Information about named entities (real-world objects) is usually harvested from different sources and organized as a multiple relational directed graph in Knowledge Bases (KBs). KBs play essential roles in many NLP modules including question answering, fact-checking, search engines, etc. KBs are big but still incomplete: relational information among entities is...
    Resource Type:
    Dissertation
    Full Text:
    Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 3.3 Entity-ELMo (E-ELMo

  • D₊₊ : Structural Credit Assignment in Tightly Coupled Multiagent Domains

    Creator:
    Rahmattalabi, Aida
    Abstract:
    Autonomous multiagent teams can be used in complex exploration tasks to both expedite the exploration and improve the efficiency. However, use of multiagent systems presents additional challenges. Specifically, in domains where the agents' actions are tightly coupled, coordinating multiple agents to achieve cooperative behavior at the group level is difficult....
    Resource Type:
    Masters Thesis
    Full Text:
    function approximates the expected reward for the agent to be in that state. V π(s) = Eπ(Rt|st = s, at

  • Approximation Schemes in Planar Graphs

    Creator:
    Zheng, Baigong
    Abstract:
    There are growing interests in designing polynomial-time approximation schemes (PTAS) for optimization problems in planar graphs. Many NP-hard problems are shown to admit PTAS in planar graphs in the last decade, including Steiner tree, Steiner forest, two- edge-connected subgraphs and so on. We follow this research line and study several...
    Resource Type:
    Dissertation
    Full Text:
    planar graphs. P stands for PTAS and E stands for EPTAS. U stands for “unweighted version of the problem

  • Nanoparticle-assisted diffusion brazing of metal microchannel arrays : nanoparticle synthesis, deposition, and characterization

    Creator:
    Eluri, Ravindranadh T.
    Abstract:
    Microchannel process technology (MPT) offers several advantages to the field of nanomanufacturing: 1) improved process control over very short time intervals owing to shorter diffusional distances; and 2) reduced reactor size due to high surface area to volume ratios and enhanced heat and mass transfer. The objective of this thesis...
    Resource Type:
    Dissertation
    Full Text:
    gratitude to Dr. Yi Liu, Dr. Frank Tepley Jr., Teresa Sawyer and Kurt Langworthy for training me in doing

  • 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:
    Survey Questionnaire 117 D Survey Results 135 E Structural Equation Modeling Results 149 Bibliography

  • Interpretable Machine Learning: Applications in Biology and Genomics

    Creator:
    Danaee, Padideh
    Abstract:
    Machine learning (ML) and deep learning (DL) models impact our daily lives with applications in natural language modeling, image analysis, healthcare, genomics, and bioinformatics. The exponential growth of biological sequence data necessitates accompanying advances in computational methods. Although deep learning is highly effective for detecting and classifying biological sequences, challenges...
    Resource Type:
    Dissertation
    Full Text:
    highly e↵ective for de- tecting and classifying biological sequences, challenges remain in extracting

  • 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:
    activations of units in the encoding layer. We represent a QBN via a continuous multilayer encoder E, which

  • 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