Browse by Subject "Computer Science"

  • Kutsch, James Albert, Jr. (1976)

    application/pdf

    application/pdfPDF (3Mb)Restricted to U of Illinois
  • Lo, Virginia Mary (1983)
    This thesis addresses the problem of task assignment in distributed systems. A distributed system is defined as any configuration of two or more processors, each with private memory, in which computations utilize the ...

    application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Horst, Robert Whiting (1991)
    This thesis introduces a parallel computer architecture known as task flow. Simple replicated cells contain both memory packets and processing logic. Each memory packet contains a data field, the next instruction, and a ...

    application/pdf

    application/pdfPDF (7Mb)Restricted to U of Illinois
  • Park, Chaeryung (1996)
    High-level synthesis becomes increasingly important in the area of VLSI CAD. This thesis addresses scheduling and allocation in high-level synthesis. Specifically, we study the problem of register allocation in the presence ...

    application/pdf

    application/pdfPDF (3Mb)Restricted to U of Illinois
  • Thearling, Kurt Henry (1990)
    In the past, research has shown that the use of high-level test knowledge can be used to greatly accelerate the test generation process. The problem was that no techniques were developed to extract this knowledge from a ...

    application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Budnik, Paul Peter, Jr. (1975)

    application/pdf

    application/pdfPDF (8Mb)Restricted to U of Illinois
  • Chandra, Susheel Jagdish (1989)
    The increasing complexity of logic circuits has made the problem of test generation intractable. In this dissertation we investigate three different techniques to speed up the test generation process. The first approach ...

    application/pdf

    application/pdfPDF (3Mb)Restricted to U of Illinois
  • Hocks, Mary Elizabeth (1994)
    This dissertation examines hypertext computer technology and computer writing practices in relation to contemporary critical theories of postmodernism, writing and response and feminism. Hypertext, a powerful computer ...

    application/pdf

    application/pdfPDF (10Mb)
  • Popescu, Andrei; Rosu, Grigore (2009-01)
    Term-generic logic (TGL) is a first-order logic parameterized with terms defined axiomatically (rather than constructively), by requiring them to only provide generic notions of free variable and substitution satisfying ...

    application/pdf

    application/pdfPDF (666Kb)
  • 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
  • Chatterjee, Abhijit (1990)
    The use of regular logic structures has become very important in the recent past due to the complexity of the circuits that are being fabricated and the need to design, test and debug them. The testability of different ...

    application/pdf

    application/pdfPDF (10Mb)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
  • application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Banerjee, Prithviraj (1985)
    The concept of algorithm-based fault-tolerance deals with system-level methods for obtaining reliable results from computations, especially when performed on array processor systems. In this scheme, algorithms have their ...

    application/pdf

    application/pdfPDF (5Mb)Restricted to U of Illinois
  • Roy, Kaushik (1990)
    This thesis concerns the problem of timing verification and synthesis of circuits for robust delay fault testability. The timing verification algorithm uses Register Transfer Level (RTL) descriptions to eliminate false ...

    application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Raman, Srilata (1994)
    In this thesis, we address timing-constrained placement and routing in symmetrical field-programmable gate arrays (FPGAs).

    application/pdf

    application/pdfPDF (5Mb)Restricted to U of Illinois
  • Mathur, Anmol (1995)
    We study several optimization problems that arise in the design of VLSI circuits, with the satisfaction of timing constraints as the primary objective. We focus on problems where the underlying architecture is regular. ...

    application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Gupta, Kamal Kant (2008-07)
    This thesis describes a system for tracking and detecting topics in personal search history. In particular, we developed a time tracking tool that helps users in analyzing their time and discovering their activity patterns. ...

    application/pdf

    application/pdfPDF (858Kb)
  • Hsiang, Jieh (1983)
    This thesis contains two parts, each deals with a different subject.

    application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Ramanan, Prakash V. (1984)
    The study of algorithm design is of fundamental importance in Computer Science. The study of algorithms includes the study of efficient data structures. This thesis deals with various aspects of combinatorial algorithms ...

    application/pdf

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