Browsing CS Technical Reports by Title
Now showing items 627-646 of 1766
-
The Gamma Database Machine Project
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
GAMMA-A High Performance Dataflow Database Machine
(University of Wisconsin-Madison Department of Computer Sciences, 1986) -
A Gauss-Newton Method for Convex Composite Optimization
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
General Convergence Conditions in Nonlinear Programming and a Kuhn-Tucker Algorithm
(University of Wisconsin-Madison Department of Computer Sciences, 1971)This paper presents a general definition of algorithmic convergence in mathematical programming and lists conditions which are sufficient for convergence in the sense of the definition. These conditions are also shown to ... -
A Generalization of Lovasz's Sandwich Theorem
(University of Wisconsin-Madison Department of Computer Sciences, 1988) -
A Generalization of Staalmarck's Method
(University of Wisconsin-Madison Department of Computer Sciences, 2011-12)This paper gives an account of Staalmarck's method for validity checking of propositional-logic formulas, and explains each of the key components in terms of concepts from the field of abstract interpretation. We then ... -
Generalized Antithetic Transformations for Monte Carlo Sampling
(University of Wisconsin-Madison Department of Computer Sciences, 1980) -
Generalized Bounded Query Hierarchies
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Generalized Containment of Conjunctive Queries
(University of Wisconsin-Madison Department of Computer Sciences, 1992) -
Generalized Equations
(University of Wisconsin-Madison Department of Computer Sciences, 1982) -
Generalized Linear Complementarity Problems as Linear Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1978)A generalized linear complementarity problem which is equivalent to finding a root of a piecewise-linear system of equations is shown to be solvable if and only if a related linear programming problem is solvable. ... -
Generalized Networks: Parallel Algorithms and an Empirical Analysis
(University of Wisconsin-Madison Department of Computer Sciences, 1989)The objective of this research was to develop and empirically test simplex ?based parallel algorithms for the generalized network optimization problem. Several parallel algorithms were developed that utilize the multitasking ... -
Generalized Search Trees for Database Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1995) -
Generalized Tableaux for Chasing Expression Constants
(University of Wisconsin-Madison Department of Computer Sciences, 1980) -
A Generalized Timed Petri Net Model for Performance Analysis
(University of Wisconsin-Madison Department of Computer Sciences, 1985) -
Generating Execution Facilities for Integrated Programming Environments
(University of Wisconsin-Madison Department of Computer Sciences, 1986) -
Generating Sparse Spanners for Weighted Graphs
(University of Wisconsin-Madison Department of Computer Sciences, 1989) -
A Generating System for CAI Teaching of Simple Algebra Problems
(University of Wisconsin-Madison Department of Computer Sciences, 1968) -
A Generative Cai Program That Teaches Algebra
(University of Wisconsin-Madison Department of Computer Sciences, 1970) -
Generic Design Patterns for Tunable and High-Performance SSD-based Indexes
(University of Wisconsin-Madison Department of Computer Sciences, 2012-12-06)A number of data-intensive systems require using random hash-based indexes of various forms, e.g., hashtables, Bloom filters, and locality sensitive hash tables. In this paper, we present general SSD optimization ...