1719 search results - page 20 / 344 » Scheduling with soft constraints |
JETAI
2010
13 years 7 months ago
2010
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
CPAIOR
2006
Springer
14 years 11 days ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
CP
2004
Springer
14 years 11 days ago
2004
Springer
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flo...
CP
2007
Springer
14 years 2 months ago
2007
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— A new call admission control (CAC) strategy based on the soft capacity constraint (SCC) concept is proposed for CDMA cellular systems. The use of the SCC concept allows maximiz...