1480 search results - page 20 / 296 » Ants can solve constraint satisfaction problems |
CIKM
2008
Springer
14 years 27 days ago
2008
Springer
This demonstration presents the concepts, design, and implementation of SCDE, a relational database systems extended with the ability to solve constraint satisfaction problems (CS...
AMC
2008
13 years 11 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
ECAI
2004
Springer
14 years 4 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
CONSTRAINTS
1998
13 years 10 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
IAT
2003
IEEE
14 years 4 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...