2723 search results - page 5 / 545 » Learning lexicographic orders |
CPAIOR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract: This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-recta...
NIPS
2004
13 years 8 months ago
2004
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a g...
DM
2010
13 years 7 months ago
2010
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
CONSTRAINTS
2010
13 years 7 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...