Browsing CS Technical Reports by Title
Now showing items 1324-1343 of 1772
-
Quadratic Convergence of a Newton Method for Nonlinear Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1972)A Newton algorithm for solving the problem minimize f(x) subject to g(x) - 0, where f:Rn - R and g:Rn - Rm is given for the case when g is concave. At each step a convex quadractic program with linear constraints is solved ... -
Quadratic Spline Function Approximation for Solution of Nonlinear Boundary Value Problem and its Application to Hencky Problem
(University of Wisconsin-Madison Department of Computer Sciences, 1969) -
A Quadratically Convergent Lagrangian Algorithm for Nonlinear Constraints
(University of Wisconsin-Madison Department of Computer Sciences, 1972)An algorithm for the nonlinearly constrained optimization problem is presented. The algorithm consists of a sequence of major iterations generated by linearizing each nonlinear constraint about the current point, and adding ... -
Qualitative Behavior of the EQS Parallel Processor Allocation Policy
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
Qualitative Computer Studies of New n-Body Models of Atoms and Molecules: Preliminary Report
(University of Wisconsin-Madison Department of Computer Sciences, 1978)We initiate in this first of a series of papers a new computer oriented approach to the modeling of atoms and molecules. Electron-electron charge interactions are included and several qualitative computations of electron ... -
Quantification and Correction of Iris Color
(University of Wisconsin-Madison Department of Computer Sciences, 2003)A system has been developed that automatically extracts the iris region from photographs, computes the iris color in CIE u 'v ' diagram color space, and corrects the color based on a standard calibration target. This system ... -
Quantifying Memory Bandwidth Limitations of Current and Future Microprocessors
(University of Wisconsin-Madison Department of Computer Sciences, 1996) -
Quantifying the Complexity of Superscalar Processors
(University of Wisconsin-Madison Department of Computer Sciences, 1996) -
A Quantum Time-Space Lower Bound for the Counting Hierarchy
(University of Wisconsin-Madison Department of Computer Sciences, 2007)We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are complete problems for the first and second levels ... -
Quasilinear Parabolic Boundary Value Problems. Approximate Solutions and Error Bounds by Linear Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1971)Constrained minimization problems are formulated from a quasilinear parabolic boundary value problem (probably with nonlinear boundary conditions), making use of the latters (conditional) inverse-positive property. ... -
Query Execution in Direct
(University of Wisconsin-Madison Department of Computer Sciences, 1978)In this paper query organization, execution,and optimization in the database machine DIRECT are discussed. We demonstrate that the use of a monitor for each relation referenced by a query along with the use of the NEXT-PAGE ... -
Query Optimization by Simulated Annealing
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
Query Processing in Firm Real-Time Database Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1994) -
Query Processing in Main Memory Database Management Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1986) -
A Queuing Network Approach to the Module Allocation Problem in Distributed Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1981) -
Quickstep: A Data Platform Based on the Scaling-In Approach
(2017-06-19)Modern servers pack enough storage and computing power that just a decade ago was spread across a modest- sized cluster. This paper presents a prototype system, called Quickstep, to exploit the large amount of paral- lelism ... -
Quickstore: A High Performance Mapped Object Store
(University of Wisconsin-Madison Department of Computer Sciences, 1994) -
The QUIQ Engine: A Hybrid IRDB System
(University of Wisconsin-Madison Department of Computer Sciences, 2003) -
Quotient Networks
(University of Wisconsin-Madison Department of Computer Sciences, 1981) -
Race Condition Detection for Debugging Shared-Memory Parallel Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1991)