350 search results - page 4 / 70 » Uncertainty in Soft Constraint Problems |
BIS
2008
13 years 9 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
FLAIRS
2003
13 years 9 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
CP
2007
Springer
14 years 1 months ago
2007
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
AI
2010
Springer
13 years 7 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 ...
ICTAI
2008
IEEE
2008
IEEE
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems
14 years 2 months ago
