Results 1  10
of
1,187,289
A BranchandPrune Algorithm for Solving Systems of Distance Constraints
 Proceedings of the 2003 IEEE International Conference on Robotics and Automation
, 2003
"... Given a set of affine varieties in R³, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties that satisfy a set of pairwise euclidean distances between them. Many problems in Robotics  such as the forward kinem ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
these distances relies on a branchandprune technique that iteratively eliminates from the space of distances entire regions which cannot contain any solution. This elimination is accomplished by applying redundant necessary conditions derived from the Theory of CayleyMenger determinants. The experimental
A BranchandPrune Algorithm for Solving Systems of Distance Constraints
"... AbstractGiven a set of affine varieties in si, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties that satisfy a set of painvise euclidean distances between them. Many problems in Roboticssuch as the forward kinemati ..."
Abstract
 Add to MetaCart
relies on a branchandprune technique that iteratively eliminates from the space of distances entire regions which cannot contain any solution. This elimination is accomplished by applying redundant necessary Conditions derived from the Theory of CayleyMenger determinants. The experimental results
A BranchandPrune Solver for Distance Constraints
 SUBMITTED TO THE IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION
"... Given some geometric elements such as points and lines in R³, subject to a set of pairwise distance constraints, the problem tackled in this paper is that of finding all possible configurations of these elements that satisfy the constraints. Many problems in Robotics (such as the position analysis ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
relies on a branchandprune technique that iteratively eliminates from the space of distances entire regions which cannot contain any solution. This elimination is accomplished by applying redundant necessary conditions derived from the theory of Distance Geometry. The experimental results qualify
A BranchandPrune Algorithm for the Molecular Distance Geometry Problem
 International Transactions in Operational Research
, 2006
"... The Molecular Distance Geometry Problem consists in finding the positions in R 3 of the atoms of a molecule, given some of the interatomic distances. We show that under an additional requirement on the given distances (which is realistic from the chemical point of view) this can be transformed to a ..."
Abstract

Cited by 33 (26 self)
 Add to MetaCart
to a combinatorial problem. We propose a BranchandPrune algorithm for the solution of this problem and report on very promising computational results.
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint
Extracting Proofs from BranchandPrune
, 2013
"... δComplete decision procedures can solve SMT problems over the reals with a wide range of nonlinear functions, allowing “δbounded errors”. The scalability of such procedures usually depends on efficient numerical procedures, whose implementation can be errorprone. It is important for δcomplete so ..."
Abstract
 Add to MetaCart
complete solvers to provide certificates to prove the correctness of their answers. We show how to do this for DPLL〈ICP〉, a general solving framework based on Interval Constraint Propagation. We focus on the construction of proof trees for the “unsat ” answers and the proofchecking of their correctness. Besides
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
, 2008
"... ..."
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Results 1  10
of
1,187,289