1480 search results - page 22 / 296 » Ants can solve constraint satisfaction problems |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
EAAI
2008
13 years 11 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
AI
2005
Springer
13 years 10 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
HICSS
1994
IEEE
14 years 3 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...