1381 search results - page 58 / 277 » Computational Complexity of Constraint Satisfaction |
143
click to vote
SAC
1994
ACM
15 years 8 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
139
click to vote
IJDMB
2010
15 years 1 months ago
2010
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
150
click to vote
ICCS
2001
Springer
15 years 8 months ago
2001
Springer
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
150
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
161
click to vote
GIS
1995
ACM
15 years 7 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)...