285 search results - page 32 / 57 » The complexity of soft constraint satisfaction |
103
click to vote
PKDD
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
102
click to vote
AI
2003
Springer
15 years 5 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
123
click to vote
CSMR
1998
IEEE
15 years 4 months ago
1998
IEEE
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...