Sciweavers

287 search results - page 36 / 58
» An Algebraic Approach to Constraint Satisfaction Problems
Sort
View
DATE
2002
IEEE
112views Hardware» more  DATE 2002»
14 years 19 days ago
Global Optimization Applied to the Oscillator Problem
The oscillator problem consists of determining good initial values for the node voltages and the frequency of oscillation and the avoidance of the DC solution. Standard approaches...
S. Lampe, S. Laur
AAAI
2007
13 years 10 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
CEC
2005
IEEE
14 years 1 months ago
Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
IJCV
2007
165views more  IJCV 2007»
13 years 7 months ago
Registration of 3D Points Using Geometric Algebra and Tensor Voting
Abstract. We address the problem of finding the correspondences of two point sets in 3D undergoing a rigid transformation. Using these correspondences the motion between the two s...
Leo Reyes, Gérard G. Medioni, Eduardo Bayro...
CP
2003
Springer
14 years 27 days ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie