Browsing CS Technical Reports by Title
Now showing items 4160 of 1769

An Algorithm for Constructing the Aspect Graph
(University of WisconsinMadison Department of Computer Sciences, 1985) 
An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs
(20160108)This paper addresses the problem of proving a given invariance property phi of a loop in a numeric program, by inferring automatically a stronger inductive invariant psi. The algorithm we present is based on both abstract ... 
Algorithmic Aspects of Polynomial Residue Class Rings
(University of WisconsinMadison Department of Computer Sciences, 1979) 
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
(University of WisconsinMadison Department of Computer Sciences, 2009)This paper provides a survey of recent progress and software for solving mixed integer nonlinear programs (MINLP) wherein the objective and constraints are defined by convex functions and integrality restrictions are ... 
Algorithms for a Class of "Convex" Nonlinear Integer Programs
(University of WisconsinMadison Department of Computer Sciences, 1976)Algorithms are given for the efficient solution of the class of nonlinear integer programs with separable convex objectives and totally unimodular constraints. Because of the special structure of this problem class, the ... 
Algorithms for Loading Object Databases
(University of WisconsinMadison Department of Computer Sciences, 1995) 
Algorithms for Partial Fraction Decomposition and Rational Function Integration
(University of WisconsinMadison Department of Computer Sciences, 1970)Algorithms for symbolic partial fraction decomposition and indefinite integration of rational functions are described. Two types of partial fraction decomposition are investigated, squarefree and complete squarefree ... 
Algorithms for Polynomial Factorization
(University of WisconsinMadison Department of Computer Sciences, 1971)Algorithms for factoring polynomials with arbitrarily large integer coefficients into their irreducible factors are described. These algorithms are based on the use of mod p factorizations and constructions based on Hensel's ... 
Algorithms for Polynomials Over a Real Algebraic Number Field
(University of WisconsinMadison Department of Computer Sciences, 1974) 
Algorithms for Rational Spline Curves
(University of WisconsinMadison Department of Computer Sciences, 1987) 
Algorithms for Scheduling Mallable and Nonmalleable Parallel Tasks
(University of WisconsinMadison Department of Computer Sciences, 1995) 
Algorithms for Solving Systems of Equations and Inequalities with Applications in Nonlinear Programming
(University of WisconsinMadison Department of Computer Sciences, 1973)Global algorithms are proposed for solving systems of nonlinear equations and inequalities. Global convergence is established under suitable assumptions. For some special cases, the rate of convergence is Rsuperlinear. ... 
Algorithms for the Geometry of SemiAlgebraic Sets
(University of WisconsinMadison Department of Computer Sciences, 1981) 
Algorithms for the Maximum Induced Bipartite Subgraph Problem on Interval and CircularArc Graphs
(University of WisconsinMadison Department of Computer Sciences, 1987) 
Algorithms for the Solution of Systems of Linear Diophantine Equations
(University of WisconsinMadison Department of Computer Sciences, 1979) 
Algorithms in Number Theory
(University of WisconsinMadison Department of Computer Sciences, 1991) 
An Almost Surely Optimal Algorithm for the Euclidean Traveling Salesman Problem
(University of WisconsinMadison Department of Computer Sciences, 1978) 
Alternating Direction Splittings for BlockAngular Parallel Optimization
(University of WisconsinMadison Department of Computer Sciences, 1994) 
An Alternating Method for Stochastic Linear Programming With Simple Recourse
(University of WisconsinMadison Department of Computer Sciences, 1983) 
An Amateur's Introduction to Recursive Query Processing Strategies
(University of WisconsinMadison Department of Computer Sciences, 1988)