CONSTRAINTS
2010
13 years 4 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
INFOCOM
2007
IEEE
13 years 10 months ago
2007
IEEE
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...