7 search results - page 1 / 2 » Abstracting Soft Constraints: Some Experimental Results on F... |
CSCLP
2003
Springer
13 years 10 months ago
2003
Springer
CSCLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
CSCLP
2003
Springer
13 years 10 months ago
2003
Springer
ing Soft Constraints: Some Experimental Results on Fuzzy CSPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Stefano Bi...
AI
2010
Springer
13 years 5 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
EUSFLAT
2009
13 years 2 months ago
2009
Abstract-- Interpretability is one of the most significant properties of Fuzzy Systems which are widely acknowledged as gray boxes against other Soft Computing techniques such as N...