Sciweavers

212 search results - page 1 / 43
» Efficient solution of systems of orientation constraints
Sort
View
ISPD
1999
ACM
83views Hardware» more  ISPD 1999»
13 years 10 months ago
Efficient solution of systems of orientation constraints
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
Joseph L. Ganley
ECCV
2006
Springer
14 years 8 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
CP
2008
Springer
13 years 7 months ago
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
When numerical CSPs are used to solve systems of n equations with n variables, the preconditioned interval Newton operator plays two key roles: First it allows handling the n equat...
Alexandre Goldsztejn, Laurent Granvilliers
ERSHOV
2006
Springer
13 years 9 months ago
Solution Strategies for Multi-domain Constraint Logic Programs
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approac...
Stephan Frank, Petra Hofstedt, Peter Pepper, Dirk ...
AAAI
1994
13 years 7 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex