• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 849
Next 10 →

Global Constraints for Lexicographic Orderings

by Alan Frisch, Brahim Hnich, Zeynep Kızıltan, Ian Miguel, Toby Walsh , 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.

by Mats Carlsson , Nicolas Beldiceanu , 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 2-Lexicographic Order

by Jacob Bower , 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

by Multi-objective Optimisation, Juan Castro-gutierrez, Dario L
"... 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

by József Dombi, Csanád Imreh, Nándor Vincze - 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

by Prof Dan, A. Simovici
"... 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

by David Broneske, Sebastian Dorok, Andreas Meister
"... For decades, database vendors have developed traditional database systems for different application domains with high-ly differing requirements. These systems are extended with additional functionalities to make them applicable for yet another data-driven domain. The database community ob-served tha ..."
Abstract - Add to MetaCart
envision applying techniques known from software product lines to database systems in order to provide tailor-made and robust database systems for nearly every application scenario with reasonable effort in cost and time.

Hoggatt sequences and lexicographic ordering

by V. E. Hoggatt, Jr., M. A Owens , 1987
"... ..."
Abstract - Add to MetaCart
Abstract not found

On lexicographical ordering in multivariate mathematical morphology

by E. Aptoula - Pattern Recognition Letters , 2008
"... Since mathematical morphology is based on complete lattice theory, a vector order-ing 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 order-ing 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

Lexicographically-Ordered Constraint Satisfaction Problems

by Eugene C. Freuder, Robert Heffernan, Richard J. Wallace, Nic Wilson , 2009
"... 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 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 multi-attribute 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
Next 10 →
Results 1 - 10 of 849
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University