566 search results - page 10 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
142
click to vote
AICCSA
2001
IEEE
15 years 8 months ago
2001
IEEE
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
130
click to vote
AIMSA
2004
Springer
15 years 10 months ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
140
Voted
CISSE
2009
Springer
15 years 8 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
145
Voted
AAAI
1998
15 years 6 months ago
1998
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
208
Voted
CP
1995
Springer
15 years 8 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...