Now showing items 21-40 of 1736

• #### An Adaptive Nonlinear Least-Squares Algorithm ﻿

(Cornell University, 1977-08)
NL2SOL is a modular program for solving nonlinear least-squares problems that incorporate a number of novel features. It maintains a secant approximation S to the second-order part of the least-squares Hessian and ...
• #### Adding the Everywhere Operator to Propositional Logic ﻿

(Cornell University, 1996-05)
Sound and complete modal propositional logic C is presented, in which "P" has the interpretation "P is true in all states". The interpretation is already known as the Carnapian extension of S5. A new axiomatization for ...
• #### Addition Requirements for Rational Functions ﻿

(Cornell University, 1975-08)
A notion of rank or independence for arbitrary sets of rational functions is developed, which bounds from below the number of additions and subtractions required of all straight-line algorithms which compute those ...
• #### Admissibility of Fixpoint Induction over Partial Types ﻿

(Cornell University, 1998-04)
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned types using fixpoint induction. However, ...
• #### ADMIT-1 : Automatic Differentiation and MATLAB Interface Toolbox ﻿

(Cornell University, 1998-01)
ADMIT-1 enables you to compute {\em sparse} Jacobian and Hessian matrices, using automatic differentiation technology, from a MATLAB environment. You need only supply a function to be differentiated and ADMIT-1 will exploit ...
• #### Advanced Feedback Methods in Information Retrieval ﻿

(Cornell University, 1983-08)
Automatic feedback methods may be used in on-line information retrieval to generate improved query statements based on information contained in previously retrieved documents. In this study automatic relevance feedback ...
• #### An Affine Scaling Algorithm for Minimizing Total Variation in ImageEnhancement ﻿

(Cornell University, 1994-12)
A computational algorithm is proposed for image enhancement based on total variation minimization with constraints. This constrained minimization problem is introduced by Rudin et al \cite{osher1,osher3,osher2} to enhance ...
• #### Agent Technology Applied to Adaptive Relay Setting for Multi-TerminalLines ﻿

(Cornell University, 2000-03-27)
Abstract: This paper discusses the adaptation of the settings of distance relays for multi-terminal lines employing agents. Agents are software processes capable of searching for information in networks, interacting with ...
• #### Alex - A Paradigm for Expressing and Compiling Matrix Functions ﻿

(Cornell University, 1993-06)
This work presents formal and practical tools to support the Alex paradigm for expressing and compiling matrix functions. Alex programs are recursive definitions over matrices with the same flavor as the elegant FP ...
• #### ALEX - an Alexical Programming Language ﻿

(Cornell University, 1987-05)
ALEX is an experimental language for high-level parallel programming. It is a testbed for exploring various non-traditional ways of expressing algorithmic ideas, making extensive use of high-resolution color graphics. ...
• #### Algebraic Specification of a Communication Scheduler ﻿

(Cornell University, 1984-06)
A distributed programming language normally incorporates one mechanism by which processes communicate with each other. This mechanism can be used to transfer information or to synchronize the flow of control in the ...
• #### An Algorithm for Checking PL/CV Arithmetic Inferences ﻿

(Cornell University, 1977-10)
This paper describes the operation and implementation of the arithmetic proof rule for the quantifier free integer arithmetic used in the PL/CV 2 program verification system. The general arithmetic satisfiability problem ...
• #### An Algorithm for Coloring the Nodes of a Graph ﻿

(Cornell University, 1970-10)
We study the problem of coloring the nodes of a graph such that two nodes joined by an arc are assigned different colors. An algorithm is presented which requires $~n^{3}$ time, where the graph contains $n$ nodes. This ...
• #### An Algorithm for Determining Whether the Connectivity of a Graph is at Least k ﻿

(Cornell University, 1973-09)
The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n$ vertices is at least $k$. First the case of undirected graphs is discussed, and then it is shown that a variation of ...
• #### An Algorithm for Extracting Phrases in a Space-Optimal Fashion ﻿

(Cornell University, 1971-02)
NO ABSTRACT SUPPLIED
• #### An Algorithm for Processing Program Transformations ﻿

(Cornell University, 1993-10)
An algorithm for processing program transformations as described by the transform construct is presented. The algorithm constructs a coordinate transformation of an abstract program based on a set of transforms and ...
• #### An Algorithm for the Newton Resultant ﻿

(Cornell University, 1993-10)
Given a system of $n+1$ generic Laurent polynomials, for $i \,=\, 1, \ldots, n+1$, \eqlabel(\InputSystem) f_i(\x) \quad = \quad \sum_{q\in \A_i} c_{iq} \,x^q; \qquad q \,=\, (q_1,\ldots,q_n); \qquad \x^q \,=\, ...
• #### The Algorithmic Analysis of Hybrid Systems ﻿

(Cornell University, 1994-10)
We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as finite automata ...
• #### Algorithmic Investigations in P-Adic Fields ﻿

(Cornell University, 1992-09)
This thesis is concerned with algorithmic investigations in p-adically closed fields, of which Hensel's field of p-adic numbers is prototypical. The well known analogies between the field of real numbers and the field ...
• #### Algorithms for Nonlinear Problems Which Use DiscreteApproximations to Derivatives ﻿

(Cornell University, 1971-05)
The most desirable algorithms for nonlinear programming problems call for obtaining the gradient of the objective and the Jacobian of the constraint function. The analytic form is often impossible and almost always impractical ...