Browsing CS Technical Reports by Title
Now showing items 472-491 of 1766
-
E: A Persistent Systems Implementation Language
(University of Wisconsin-Madison Department of Computer Sciences, 1989)This thesis presents the design and implementation of the E-programming language. E is an extension of C++ designed for building systems that manage persistent objects, e.g. a database management system. Several aspects ... -
Earliest Deadline Scheduling for Real-Time Database Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1991) -
EASEy-2: An English-Like Program Language
(University of Wisconsin-Madison Department of Computer Sciences, 1973) -
EASEy: An English-Like Programming Language for Artificial Intelligence and Complex Information Processing
(University of Wisconsin-Madison Department of Computer Sciences, 1974)EASEy (an Encoder for Algorithmic Syntactic English that's easy)is a programming language for list-processing and pattern-matching systems of the sort typically used for artificial intelligence and complex information ... -
ECP-An Error-Correcting-Parser Generator User Guide
(University of Wisconsin-Madison Department of Computer Sciences, 1981) -
Edge Detection in Complex Scenes Based on Gestalt Principles of Proximity and Similarity
(University of Wisconsin-Madison Department of Computer Sciences, 1974)An edge detection function is defined on a very broad class of pictures. It departs from previous approaches to edge detection, which are based on differences in intensity or other properties between adjacent areas of a ... -
Edge Separation and Orientation Texture Measures
(University of Wisconsin-Madison Department of Computer Sciences, 1984) -
Effective Separation of Disjunctive Cuts for Convex Mixed Integer Nonlinear Programs
(University of Wisconsin-Madison Department of Computer Sciences, 2010)We describe a computationally effective method for generating disjunctive inequalities for convex mixed-integer nonlinear programs (MINLPs). The method relies on solving a sequence of cut-generating linear programs, ... -
Effective Slicing: A Generalization of Full and Relevant Slicing
(University of Wisconsin-Madison Department of Computer Sciences, 2008)A program slice, -
Effective, Automatic Procedure Extraction
(University of Wisconsin-Madison Department of Computer Sciences, 2003) -
The Effects of Faults in Cache Memories
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
Efficient Algorithms for Multiple Pattern Matching
(University of Wisconsin-Madison Department of Computer Sciences, 1986) -
Efficient Algorithms for Polyhedron Collision Detection
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
Efficient Analysis of Parallel Processor Scheduling Policies
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
Efficient Analysis of the Process Structures of Formally Defined Complexes of Interacting Digital Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1974)Basic processes are presented as uniquely suitable structural units for the initial analysis of a formally defined complex of interacting digital systems. An algorithm is given for decomposing a complex into its basic ... -
Efficient Comparison of Program Slices
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Efficient Detection of All Pointer and Array Access Errors
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
The Efficient Parallel Solution of Generalized Network Flow Problems
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Efficient Program Monitoring Techniques
(University of Wisconsin-Madison Department of Computer Sciences, 1996) -
Efficient Race Condition Detection for Shared-Memory Programs with Post/Wait Synchronization
(University of Wisconsin-Madison Department of Computer Sciences, 1992)