Search Constraints

Start Over
Filtering by: Creator Gamroth, M. J. (Michael J.) Remove constraint Creator: Gamroth, M. J. (Michael J.) Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Degree Name Doctor of Philosophy (Ph.D.) Remove constraint Degree Name: Doctor of Philosophy (Ph.D.)

Search Results

  • Analytical Methods for Improving Causal Inference

    Creator:
    Sinha, Meghamala
    Abstract:
    Causal inference is an important analytical tool to bridge the gap between prediction and decision-making. However, learning a causal network solely from data is a challenging task. In this work, various techniques have been explored for a better and improved causal network learning from data. Firstly, the problem of learning...
    Resource Type:
    Dissertation
    Full Text:
    distribution of p after intervention is: p(V1, ..., Vn) = ∏ Vi∈Oe pi(Vi | Pa(Vi)) · ∏ Vj∈Ie p′j(Vj | Pa(Vj

  • Inclusive Software Design and Its Methods for Beyond-WIMP User Interfaces

    Creator:
    Fallatah, Abrar
    Abstract:
    While digital inclusivity researchers and software practitioners have been trying to address exclusion biases in Windows, Icons, Menus, and Pointers (WIMP) user interfaces (UIs) for a long time, little has been done to investigate if and how inclusive software design and its methods that have been devised for WIMP UIs...
    Resource Type:
    Dissertation

  • 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:
    this type and a binary vector of length b m with weight b; in a given configuration, if the j-th box

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    Lipschitz Continuity of ∇M ∞ θk J(θk) . . . . . . . . . 199 LIST OF FIGURES Figure Page 2.1 Performance

  • Update programming -- a safe approach to software maintenance

    Creator:
    Ren, Deling
    Abstract:
    Software maintenance accounts for a large portion of the software development cost, particularly the process of updating programs either to adapt for requirement change or to enhance design or efficiency. Currently, program updates are generally performed manually by programmers using text editors. This is an unreliable method because syntax and...
    Resource Type:
    Dissertation
    Full Text:
    &DEN1�581yF;3<1qp@()9,$ c�9,$'5jc=()&)$'9Ý(D*H5N3N1@9;M;?A58(D14*�581�587;$�*;$'?/$/EjH

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    = tj;1 + tj;2 + : : :+ tj;m Then, ei�j = l=1;2;::: ;mX k=1;2;::: ;n tk;l tk;l = ti;k � tj;l 8i

  • 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:
    Tadepalli provided useful feedback on EBL related issues and proof-read most of my papers. Michael Scanlan

  • Explanations and Processes to Enable Humans to Assess AI with Respect to Manipulable Properties

    Creator:
    Dodge, Jonathan E.
    Abstract:
    Assessing AI systems is difficult. Humans rely on AI systems in increasing ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools (e.g., a professional auditor, a developer, and an end user all have different needs). We posit that it is possible to provide...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172 I Log Appendix - Moving with Heuristic Agents . . . . . . . . . . . . . . . . 174 J Data

  • 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:
    AN ABSTRACT OF THE DISSERTATION OF Jeffrey M. Young for

  • 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:
    2.2 Global accuracy minus local accuracy per bin of rarity measure Pr(e|m) which is scaled to (0, 100