1480 search results - page 103 / 296 » Ants can solve constraint satisfaction problems |
155
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- We present a bus arbitration scheme for soft real-time constrained embedded systems. Some masters in such systems are required to complete their work for given timing constraints...
262
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
293
click to vote
AGP
2010
IEEE
15 years 11 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
150
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
193
click to vote
GIS
1995
ACM
15 years 10 months ago
1995
ACM
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...