Results 1  10
of
425,487
Quantifier Elimination for Quartics
"... Abstract. Concerning quartics, two particular quantifier elimination (QE) problems of historical interests and practical values are studied. We solve the problems by the theory of complete discrimination systems and negative root discriminant sequences for polynomials that provide a method for real ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Concerning quartics, two particular quantifier elimination (QE) problems of historical interests and practical values are studied. We solve the problems by the theory of complete discrimination systems and negative root discriminant sequences for polynomials that provide a method for real
On the Combinatorial and Algebraic Complexity of Quantifier Elimination
, 1996
"... In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields is given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this date. A new feature of this algorithm is that the role of th ..."
Abstract

Cited by 230 (29 self)
 Add to MetaCart
In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields is given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this date. A new feature of this algorithm is that the role
Constraint Query Languages
, 1992
"... We investigate the relationship between programming with constraints and database query languages. We show that efficient, declarative database programming can be combined with efficient constraint solving. The key intuition is that the generalization of a ground fact, or tuple, is a conjunction ..."
Abstract

Cited by 372 (43 self)
 Add to MetaCart
, we use quantifier elimination techniques from logic and the concept of data complexity from database theory. This framework is applicable to managing spatial data and can be combined with existing multidimensional searching algorithms and data structures.
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Applying Linear Quantifier Elimination
, 1993
"... The linear quantifier elimination algorithm for ordered fields in [15] is applicable to a wide range of... ..."
Abstract

Cited by 86 (11 self)
 Add to MetaCart
The linear quantifier elimination algorithm for ordered fields in [15] is applicable to a wide range of...
Formulae, Algorithms, and Quartic Extrema
"... this paper. Given the points (x i ; y i ) equal to (0; 4), (1; 2), (3; 1), (4; 2), (6; 5), find a convex polynomial that passes through them. The Lagrange interpolating polynomial is a quartic: yL = ..."
Abstract
 Add to MetaCart
this paper. Given the points (x i ; y i ) equal to (0; 4), (1; 2), (3; 1), (4; 2), (6; 5), find a convex polynomial that passes through them. The Lagrange interpolating polynomial is a quartic: yL =
Linear leastsquares algorithms for temporal difference learning
 Machine Learning
, 1996
"... Abstract. We introduce two new temporal difference (TD) algorithms based on the theory of linear leastsquares function approximation. We define an algorithm we call LeastSquares TD (LS TD) for which we prove probabilityone convergence when it is used with a function approximator linear in the adju ..."
Abstract

Cited by 255 (1 self)
 Add to MetaCart
information from training experiences. We describe a simulation experiment showing the substantial improvement in learning rate achieved by RLS TD in an example Markov prediction problem. To quantify this improvement, we introduce the TD error variance of a Markov chain, arc,, and experimentally conclude
Parallelization of Quantifier Elimination on Workstation Network
 In Proceedings of AAECC 10 (Puerto Rico), Springer Lecture Notes in Computer Science 673
, 1991
"... This paper reports our effort to parallelize on a network of workstations the quantifier elimination algorithm over the reals which was devised by Collins and improved by the author. The preliminary experiments show both sublinear and superlinear speedups due to speculative parallelism. On the pro ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
This paper reports our effort to parallelize on a network of workstations the quantifier elimination algorithm over the reals which was devised by Collins and improved by the author. The preliminary experiments show both sublinear and superlinear speedups due to speculative parallelism
A Simple Quantifierfree Formula of Positive Semidefinite Cyclic Ternary Quartic Forms
"... The problem of quantifier elimination of positive semidefinite cyclic ternary quartic forms is studied in this paper. We solve the problem by function RealTriangularize in Maple15, the theory of complete discrimination systems and the socalled Criterions on Equality of Symmetric Inequalities method ..."
Abstract
 Add to MetaCart
The problem of quantifier elimination of positive semidefinite cyclic ternary quartic forms is studied in this paper. We solve the problem by function RealTriangularize in Maple15, the theory of complete discrimination systems and the socalled Criterions on Equality of Symmetric Inequalities
Results 1  10
of
425,487