Browse Dissertations and Theses - Computer Science by Title

  • Hoot, Charles Glen (1996)
    Rewriting is a computational process in which one term is derived from another by replacing a subterm with another subterm in accordance with a set of rules. If such a set of rules (rewrite system) has the property that ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Hamzaoglu, Ilker (1999)
    Finally, we propose a new synthesis technique for reducing the test application time of counter-based exhaustive built-in-self-test test pattern generators. This technique reduces the test application time by reducing the ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Cheng, Wu-Tung (1985)
    The test methods of general iterative logic arrays (ILAs) composed of combinational cells are considered in the first part of this report. The fault model assumed is that faults in a cell can change a cell behavior in any ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Mahdian, Peyman (2017-07-17)
    We show a new approach in learning conjunctive invariants using dynamic testing of the program. Coming up with correct set of loop invariant is the most challenging part of any verification methods. Although new methods ...

    application/pdf

    application/pdfPDF (350kB)Restricted Access
  • Luo, Qingzhou (2015-06-02)
    With the development of multi-core processors, concurrent programs are becoming more and more popular. Among several models, the multithreaded shared-memory model is the predominant programming paradigm for developing ...

    application/pdf

    application/pdfPDF (1MB)
  • Guoy, Damrong (2001)
    The persistent appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Tao, Fangbo (2017-12-06)
    A large portion of real world data is either text or structured (\eg, relational) data. Such data objects are often linked together (\eg, structured product information linking with their descriptions and customer reviews.). ...

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Lai, Alice Yingming (2018-12-03)
    Understanding the meaning of linguistic expressions is a fundamental task of natural language processing. While distributed representations have become a powerful technique for modeling lexical semantics, but they have ...

    application/pdf

    application/pdfPDF (2MB)
  • Kim, Wooyoung (1997)
    This thesis studies how to support communication between actors efficiently. First, we discuss communication patterns commonly arising in many parallel applications in the context of an experimental actor-based language, ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Gordon, Spencer L (2017-04-21)
    The complexity class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the complexity of some well-known problems in PPAD ∩ PLS that have resisted, in some cases for decades, attempts to ...

    application/pdf

    application/pdfPDF (2MB)
  • Lin, Jacob Je-Chian (2018-04-25)
    This thesis reexamines the current bottlenecks of production management in construction and designs the key human-information interfaces within a new visual production management (VPM) system for proactive project controls ...

    application/pdf

    application/pdfPDF (2MB)Restricted Access
  • Heumann, Stephen T. (2016-07-11)
    Today's state-of-the-art concurrent programming models either provide weak safety guarantees, making it easy to write code with subtle errors, or are limited in the class of programs that they can express. I believe that ...

    application/pdf

    application/pdfPDF (2MB)
  • application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Laud, Adam Daniel (2004)
    We demonstrate our theory with two applications: a stochastic gridworld, and a bipedal walking control task. In all cases, the experiments uphold the analytical predictions; most notably that reducing the reward horizon ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Wu, Zhe (2001)
    Finally, we demonstrate the efficiency and effectiveness of our proposed theory and methods. DLM is able to solve systematically general discrete, continuous and mixed-integer constrained benchmarks, which is a task not ...

    application/pdf

    application/pdfPDF (10MB)Restricted to U of Illinois
  • O'Kane, Jason M. (2007-07)
    As robots interact with the physical world, their usefulness depends directly on how effectively they can sense and move through their environments. Unfortunately, sensors provide only limited (and sometimes incorrect) ...

    application/pdf

    application/pdfPDF (2MB)
  • Thati, Prasannaa (2003)
    The central idea behind our proof techniques for testing equivalence is to obtain semantic characterizations of the equivalence that do away with universal quantification over contexts. Using these characterizations one ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Pottenger, William Morton (1997)
    The study of theoretical and practical issues in automatic parallelization across application and language boundaries is an appropriate and timely task. In this work, we discuss theory and techniques that we have determined ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Wong, Chi-Leung (2005)
    The widespread popularity of languages allowing explicitly parallel, multi-threaded programming, e.g. Java and C#, have focused attention on the issue of memory model design. The Pensieve Project is building a compiler ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Chow, Wing Fai (2003)
    For the eigenvalue problem, a novel variant of Davidson's method, or spectrally localized Arnoldi's method, is used. The full-size problem is projected onto Krylov subspaces of limited size with an explicitly orthogonalized ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois