Results 1  10
of
849
Global Constraints for Lexicographic Orderings
, 2002
"... We propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for breaking a certain kind of symmetry arising in matrices of decision variables. We show ..."
Abstract

Cited by 83 (35 self)
 Add to MetaCart
We propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for breaking a certain kind of symmetry arising in matrices of decision variables. We show
Revisiting the lexicographic ordering constraint.
, 2002
"... Abstract. We present a global consistency algorithm for the lexicographic ordering constraint on two vectors of variables. The algorithm maintains arcconsistency, runs in time per propagation event, and detects entailment or rewrites itself to a simpler constraint whenever possible. The algorithm w ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
Abstract. We present a global consistency algorithm for the lexicographic ordering constraint on two vectors of variables. The algorithm maintains arcconsistency, runs in time per propagation event, and detects entailment or rewrites itself to a simpler constraint whenever possible. The algorithm
Problem 2Lexicographic Order
, 2008
"... Problem: For complex numbers z = a + bi ∈ C and w = c + di ∈ C define ”z ≺ w ” if either a < c or if ( a = c and b < d), where < has the traditional ”less than ” meaning on R. We will call this the ”lexicographic ordering of C”. (Question I) Prove that this turns C into and ordered set. (Qu ..."
Abstract
 Add to MetaCart
Problem: For complex numbers z = a + bi ∈ C and w = c + di ∈ C define ”z ≺ w ” if either a < c or if ( a = c and b < d), where < has the traditional ”less than ” meaning on R. We will call this the ”lexicographic ordering of C”. (Question I) Prove that this turns C into and ordered set
Improved Dynamic Lexicographic Ordering for
"... Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. establishing weights in a weighted approach or setting the ordering in a lexicographic approach). In manyobjective optimizati ..."
Abstract
 Add to MetaCart
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. establishing weights in a weighted approach or setting the ordering in a lexicographic approach). In manyobjective
Learning lexicographic orders
 European Journal of Operational Research
, 2007
"... The purpose of this paper is to learn the order of criteria of lexicographic decision under various reasonable assumptions. We give a sample evaluation and an oracle based algorithm. In the worst case analysis we are dealing with the adversarial models. We show that if the distances of the samples a ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
The purpose of this paper is to learn the order of criteria of lexicographic decision under various reasonable assumptions. We give a sample evaluation and an oracle based algorithm. In the worst case analysis we are dealing with the adversarial models. We show that if the distances of the samples
Listing Monomials in Lexicographical Order
"... Let MONn be the set of monomials that can be formed using n variables u1,...,un. We start from the ordered list of literals: u1,ū1,u2,ū2,...,un,ūn, and construct a the Rymon tree: the root of the tree is the empty monomial (); if µ is a monomial that labels a node and the largest literal in µ is ui ..."
Abstract
 Add to MetaCart
Let MONn be the set of monomials that can be formed using n variables u1,...,un. We start from the ordered list of literals: u1,ū1,u2,ū2,...,un,ūn, and construct a the Rymon tree: the root of the tree is the empty monomial (); if µ is a monomial that labels a node and the largest literal in µ is ui
*author names are in lexicographical order
"... For decades, database vendors have developed traditional database systems for different application domains with highly differing requirements. These systems are extended with additional functionalities to make them applicable for yet another datadriven domain. The database community observed tha ..."
Abstract
 Add to MetaCart
envision applying techniques known from software product lines to database systems in order to provide tailormade and robust database systems for nearly every application scenario with reasonable effort in cost and time.
On lexicographical ordering in multivariate mathematical morphology
 Pattern Recognition Letters
, 2008
"... Since mathematical morphology is based on complete lattice theory, a vector ordering method becomes indispensable for its extension to multivariate images. Among the several approaches developed with this purpose, lexicographical orderings are by far the most frequent, as they possess certain desir ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Since mathematical morphology is based on complete lattice theory, a vector ordering method becomes indispensable for its extension to multivariate images. Among the several approaches developed with this purpose, lexicographical orderings are by far the most frequent, as they possess certain
LexicographicallyOrdered Constraint Satisfaction Problems
, 2009
"... We describe a simple CSP formalism for handling multiattribute preference problems with hard constraints, one that combines hard constraints and preferences so the two are easily distinguished conceptually and for purposes of problem solving. Preferences are represented as a lexicographic order ov ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We describe a simple CSP formalism for handling multiattribute preference problems with hard constraints, one that combines hard constraints and preferences so the two are easily distinguished conceptually and for purposes of problem solving. Preferences are represented as a lexicographic order
Results 1  10
of
849