Browse by Subject "Computer Science"

  • LaValle, Steven Michael (1995)
    The primary contribution of this dissertation is the presentation of a dynamic game-theoretic framework that is used as an analytical tool and unifying perspective for a wide class of problems in robot motion planning. The ...
    untranslated PDF (11MB)Restricted to U of Illinois
  • Keiper, Jerry Bruce (1989)
    We study the numerical solution of Hessenberg form differential algebraic equations by variable stepsize generalized backward difference formulae (GBDF). GBDF methods of sufficiently high order are shown to converge for ...
    untranslated PDF (3MB)Restricted to U of Illinois
  • Maddila, Sanjeev Rao (1989)
    This thesis proposes a decomposition-based algorithmic paradigm, called planning with local experts, where the given global planning problem is decomposed into a set of subproblems that are each solved efficiently in a ...
    untranslated PDF (6MB)Restricted to U of Illinois
  • Facello, Michael Allen (1996)
    Macromolecules such as proteins and DNA have complex spatial structures which are often important for their biological functions. The idea of molecular shape and shape complementarity play crucial roles in protein folding, ...
    untranslated PDF (4MB)Restricted to U of Illinois
  • Decoste, Dennis Martin (1994)
    This research explores the representational and computational complexities of qualitative reasoning about time-varying behavior. Traditional techniques employ qualitative simulation (QS) to compute envisionments (i.e. ...
    untranslated PDF (7MB)Restricted to U of Illinois
  • Goering, Steven Kent (1990)
    We propose the use of graph grammars as a theory to organize programming of highly-concurrent systems. To understand the interactions among components of a concurrent system it is useful to visualize the system as dynamically ...
    untranslated PDF (12MB)Restricted to U of Illinois
  • McGuinness, Patrick James (1992)
    A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to H can be obtained from G by a series of vertex deletions, edge deletions, and edge contractions. Graph minors have been ...
    untranslated PDF (5MB)Restricted to U of Illinois
  • McKinley, Philip Keith (1989)
    In recent years, there has been an increase in the number of group-based applications composed of cooperative processing entities. Examples include multimedia teleconferencing, distributed databases, distributed operating ...
    untranslated PDF (5MB)Restricted to U of Illinois
  • Choi, Lynn (1996)
    Reducing memory latency is critical to the performance of large-scale parallel systems. Due to the temporal and spatial locality of memory reference patterns, private caches can eliminate redundant memory accesses and ...
    untranslated PDF (5MB)Restricted to U of Illinois
  • Beckmann, Carl Josef (1993)
    This thesis examines nonloop parallelism at both fine and coarse levels of granularity in numerical FORTRAN programs. Measurements of the extent of this functional parallelism in a number of FORTRAN codes are presented, ...
    untranslated PDF (10MB)Restricted to U of Illinois
  • Najem, Ziad H. (1994)
    A central component of expertise is control knowledge which describes the approach to solving a problem. Human experts are capable of utilizing their control knowledge in different contexts. For example, an expert can ...
    untranslated PDF (8MB)Restricted to U of Illinois
  • Karnik, Tanay (1995)
    Field-programmable gate arrays (FPGAs) allow circuit designers to perform quick prototyping and development. In this thesis we attempt to partition and place a hierarchically described system on multiple FPGA chips so as ...
    untranslated PDF (6MB)Restricted to U of Illinois
  • Young, Luke Titus (1993)
    This thesis describes a test environment for evaluating computer system dependability, wherein faults are injected via software and the impact is measured by both software and hardware. The hybrid nature of the environment ...
    untranslated PDF (5MB)Restricted to U of Illinois
  • Shiffer, Michael Joseph (1992)
    The primary objective of this research is to widen the range of questions that can be addressed in small group planning situations. This can be accomplished through improved access to tools, media, and group cognition. ...
    untranslated PDF (8MB)Restricted to U of Illinois
  • Katz, Bruce Farrell (1990)
    Previous efforts to integrate Explanation-Based Learning (EBL) and Similarity-Based Learning (SBL) have treated these two methods as distinct interactive processes. In contrast, the synthesis presented here views these ...
    untranslated PDF (5MB)Restricted to U of Illinois
  • Springer, Jonathan Charles (1996)
    Imperative and functional programming are two styles which have long been viewed as incompatible. In particular, the functional property of referential transparency could not be maintained in the face of destructive update, ...
    untranslated PDF (7MB)Restricted to U of Illinois
  • Josephson, Norman Alan (1989)
    Rewrite systems are directed equations that can be used to compute by repeatedly rewriting an initial term until a final form is obtained. Such systems provide a nondeterministic programming language having convenient ...
    untranslated PDF (5MB)Restricted to U of Illinois
  • Liu, Changwen (1996)
    The thesis is concerned with the behavior of corrupted real-time control systems and their corrupted trajectories. The difference between the corrupted trajectory and the precise trajectory is called the tracking error. ...
    untranslated PDF (3MB)Restricted to U of Illinois
  • Gooley, Markian Myron (1991)
    Search is ubiquitous in computer science, but most searches are performed under constraints: time, memory, dependences. We study several cases of constrained search and present methods for improving their performance. ...
    untranslated PDF (6MB)Restricted to U of Illinois
  • Wang, Xiaoge (1994)
    A new family of preconditioners for conjugate gradient-like iterative methods applied to large sparse linear least squares problems, $min\Vert Ax-b\Vert\sb2$, is proposed. The family is based on incomplete Gram-Schmidt ...
    untranslated PDF (10MB)Restricted to U of Illinois