Sciweavers

2723 search results - page 3 / 545
» Learning lexicographic orders
Sort
View
LOGCOM
2002
92views more  LOGCOM 2002»
13 years 5 months ago
Operators and Laws for Combining Preference Relations
The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator ma...
Hajnal Andréka, Mark Ryan, Pierre-Yves Scho...
ICDE
1995
IEEE
118views Database» more  ICDE 1995»
14 years 7 months ago
A Version Numbering Scheme with a Useful Lexicographical Order
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we...
Arthur M. Keller, Jeffrey D. Ullman
PPSN
2010
Springer
13 years 4 months ago
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation
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. esta...
Juan Pedro Castro Gutiérrez, Dario Landa-Si...
AI
2006
Springer
13 years 6 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
CSCLP
2005
Springer
13 years 11 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth