1480 search results - page 53 / 296 » Ants can solve constraint satisfaction problems |
CSR
2006
Springer
15 years 1 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
AAAI
2000
14 years 11 months ago
2000
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
78
Voted
CORR
2011
Springer
14 years 1 months ago
2011
Springer
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...
96
Voted
AAAI
2008
14 years 12 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...