1453 search results - page 48 / 291 » Partial Constraint Satisfaction |
CAD
1999
Springer
14 years 9 months ago
1999
Springer
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
AAAI
2004
14 years 11 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
IPL
2006
14 years 9 months ago
2006
We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O(nm dn/3) t...
ISQED
2005
IEEE
15 years 3 months ago
2005
IEEE
Layout migration has re-emerged as an important task due to the increasing use of library hard intellectual properties. While recent advances of migration tools have accommodated ...
102
click to vote
AI
2001
Springer
15 years 2 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...