Results 1  10
of
213,228
The geometry of algorithms with orthogonality constraints
 SIAM J. MATRIX ANAL. APPL
, 1998
"... In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal proces ..."
Abstract

Cited by 638 (1 self)
 Add to MetaCart
In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal
Theorem 1.1. Algebraic constraints N∑
, 2004
"... We exhibit three classes of algebraic constraints which are shown compatible with ..."
Abstract
 Add to MetaCart
We exhibit three classes of algebraic constraints which are shown compatible with
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
agents that communicate by placing, checking and instantiating constraints on shared variables. Such a view of computation is interesting in the context of programming languages because of the ability to represent and manipulate partial information about the domain of discourse, in the con
A Formal Study of Algebraic Constraint
"... We present a model for computation of algebraic constraint. An algebraic constraint is defined to be a boolean formula of equations in which every equation is expressed by a polynomial over a field, and hence such constraint may contain negation of an equation, that is, a form f � = 0 where f is som ..."
Abstract
 Add to MetaCart
We present a model for computation of algebraic constraint. An algebraic constraint is defined to be a boolean formula of equations in which every equation is expressed by a polynomial over a field, and hence such constraint may contain negation of an equation, that is, a form f � = 0 where f
Algebraic Constraints, Automata, and Regular Languages
, 2000
"... A class of decision problems is Boolean if it is closed under the settheoretic operations of union, intersection and complementation. The paper introduces new Boolean classes of decision problems based on algebraic constraints imposed on transitions of finite automata. We discuss issues relate ..."
Abstract
 Add to MetaCart
A class of decision problems is Boolean if it is closed under the settheoretic operations of union, intersection and complementation. The paper introduces new Boolean classes of decision problems based on algebraic constraints imposed on transitions of finite automata. We discuss issues
as an SU(2) Gauge System: Algebraic Constraint Quantization
, 1995
"... Starting from the structural similarity between the quantum theory of gauge systems and that of the Kepler problem, an SU(2) gauge description of the fivedimensional Kepler problem is given. This nonabelian gauge system is used as a testing ground for the application of an algebraic constraint quan ..."
Abstract
 Add to MetaCart
Starting from the structural similarity between the quantum theory of gauge systems and that of the Kepler problem, an SU(2) gauge description of the fivedimensional Kepler problem is given. This nonabelian gauge system is used as a testing ground for the application of an algebraic constraint
Constraint propagation algorithms for temporal reasoning
 Readings in Qualitative Reasoning about Physical Systems
, 1986
"... Abstract: This paper revises and expands upon a paper presented by two of the present authors at AAAI 1986 [Vilain & Kautz 1986]. As with the original, this revised document considers computational aspects of intervalbased and pointbased temporal representations. Computing the consequences of t ..."
Abstract

Cited by 428 (5 self)
 Add to MetaCart
reasoning; of these, one of the most attractive is James Allen's algebra of temporal intervals [Allen 1983]. This representation scheme is particularly appealing for its simplicity and for its ease of implementation with constraint propagation algorithms. Reasoners based on
Algebraic Constraint Quantization and the Pseudo–Rigid Body ∗ Michael
, 1999
"... The pseudo–rigid body represents an example of a constrained system with a nonunimodular gauge group. This system is used as a testing ground for the application of an algebraic constraint quantization scheme which focusses on observable quantities, translating the vanishing of the constraints into ..."
Abstract
 Add to MetaCart
The pseudo–rigid body represents an example of a constrained system with a nonunimodular gauge group. This system is used as a testing ground for the application of an algebraic constraint quantization scheme which focusses on observable quantities, translating the vanishing of the constraints
Combining deduction and algebraic constraints for hybrid system analysis
 VERIFY’07 at CADE’07, CEURWS.org (2007
"... Abstract. We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deductive and algebraic reasoning that is used for handling the joint discrete and continuous behaviour of hybrid s ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Abstract. We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deductive and algebraic reasoning that is used for handling the joint discrete and continuous behaviour of hybrid
Results 1  10
of
213,228