2410 search results - page 89 / 482 » Multiset Ordering Constraints |
143
Voted
ECSQARU
2009
Springer
15 years 2 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
143
Voted
ICDM
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper we study the problem of classifier learning where the input data contains unjustified dependencies between some data attributes and the class label. Such cases arise...
218
click to vote
PROCEDIA
2011
14 years 7 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
236
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constr...
136
click to vote
ECP
1997
Springer
15 years 9 months ago
1997
Springer
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...