749 search results - page 15 / 150 » Dualities for Constraint Satisfaction Problems |
APIN
2006
13 years 11 months ago
2006
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
PROCEDIA
2011
13 years 2 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
CEC
2009
IEEE
14 years 3 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
AUSAI
2003
Springer
14 years 4 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
AMAI
1999
Springer
13 years 11 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...