566 search results - page 19 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
143
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
136
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional...
130
click to vote
HIS
2004
15 years 6 months ago
2004
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
154
click to vote
CIE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
136
Voted
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...