Sciweavers

1483 search results - page 9 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
IJCAI
1989
14 years 1 days ago
Domain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Paul R. Cooper, Michael J. Swain
BPSC
2009
240views Business» more  BPSC 2009»
14 years 7 hour ago
Modelling and Solving Configuration Problems on Business Processes Using a Multi-Level Constraint Satisfaction Approach
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
Wolfgang Runte
ICPR
2008
IEEE
15 years 2 days ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
WSCG
2004
118views more  WSCG 2004»
14 years 8 days ago
New Method for Geometric Constraint Solving Based on the Genetic Quantum Algorithm
This paper proposes a novel genetic quantum algorithm (GQA) to solve geometric constraint problems. Instead of binary, numeric or symbolic representation, we introduce qubit chrom...
Chunhong Cao, Wenhui Li
TEC
2002
163views more  TEC 2002»
13 years 10 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon