1453 search results - page 114 / 291 » Partial Constraint Satisfaction |
143
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
150
Voted
IJCAI
1997
15 years 5 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
103
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
stract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the noti...
131
click to vote
DSS
2007
15 years 4 months ago
2007
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
119
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...