1480 search results - page 113 / 296 » Ants can solve constraint satisfaction problems |
163
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
203
click to vote
AIA
2006
15 years 7 months ago
2006
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
179
click to vote
ICCBR
2005
Springer
15 years 12 months ago
2005
Springer
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes r...
170
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
188
click to vote
AAAI
2000
15 years 7 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...