1197 search results - page 14 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICRA
2003
IEEE
14 years 1 months ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
AI
2005
Springer
13 years 7 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...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
IJCNN
2000
IEEE
14 years 11 days ago
2000
IEEE
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
IEEEARES
2006
IEEE
14 years 2 months ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...