64 search results - page 5 / 13 » Temporal Preference Optimization as Weighted Constraint Sati... |
ICMCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Video transmission over a heterogeneous network suffers a condition that it has required to satisfy many different constraints because of the variety limitations of client equipme...
FLAIRS
2003
13 years 8 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
INFFUS
2006
13 years 7 months ago
2006
The bipolar view in preference modeling distinguishes between negative and positive preferences. Negative preferences correspond to what is rejected, considered unacceptable, whil...
CP
1995
Springer
13 years 11 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
CP
2011
Springer
12 years 7 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...