Sciweavers

980 search results - page 42 / 196
» Decentralized Constraint Satisfaction
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
CAD
1999
Springer
13 years 7 months ago
Geometric constraint satisfaction using optimization methods
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
Jian-Xin Ge, Shang-Ching Chou, Xiao-Shan Gao
AAAI
2004
13 years 9 months ago
Domain Transmutation in Constraint Satisfaction Problems
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...
James Bowen, Chavalit Likitvivatanavong
IPL
2006
89views more  IPL 2006»
13 years 7 months ago
Optimal 2-constraint satisfaction via sum-product algorithms
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...
Mikko Koivisto
ISQED
2005
IEEE
112views Hardware» more  ISQED 2005»
14 years 1 months ago
Two-Dimensional Layout Migration by Soft Constraint Satisfaction
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 ...
Qianying Tang, Jianwen Zhu