DMCA
Distributed Hard and Soft Non-binary Constraints: An Any-Time Proposal
Cached
Download Links
by
Miguel A. Salido
,
Federico Barber
BibTeX
@MISC{Salido_distributedhard,
author = {Miguel A. Salido and Federico Barber},
title = {Distributed Hard and Soft Non-binary Constraints: An Any-Time Proposal},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constraints. Hard constraints must hold while soft constraints may be violated but as many as possible should be satisfied. Although the problem constraints can be divided into two groups, the order in which these constraints are studied can improve e#ciency, particulary in problems with non-binary constraints.
