1051 search results - page 41 / 211 » Foundations of Constraint Satisfaction |
79
Voted
JCP
2008
15 years 13 days ago
2008
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
125
Voted
CONSTRAINTS
2010
15 years 17 days ago
2010
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...
86
Voted
CAD
1999
Springer
15 years 4 days 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
15 years 1 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...
92
Voted
IPL
2006
15 years 13 days 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...