Results 211 to 220 of about 20,803 (249)
Some of the next articles are maybe not open access.
Lexicographic Order and Linearity
Designs, Codes and Cryptography, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Soft Constraints for Lexicographic Orders
2013While classical Constraint Satisfaction Problems (CSPs) concern the search for the boolean assignment of a set of variables that has to satisfy some given requirements, their soft variant considers ordered domains for assignments, thus modeling preferences: the aim is to provide an environment where suitable algorithms (e.g.
GADDUCCI, FABIO +3 more
openaire +1 more source
Extreme Choices on Complete Lexicographic Orders
Mathematical Logic Quarterly, 1991We work in Zermelo-Fraenkel set theory without the axiom of choice. For each linearly ordered set \((X,
openaire +2 more sources
Matrices with lexicographically-ordered rows
Optimization Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Security Games over Lexicographic Orders
2020Security is rarely single-dimensional and is in most practical instances a tradeoff between dependent, and occasionally conflicting goals. The simplest method of multi-criteria optimization and games with vector-valued payoffs, is transforming such games into ones with scalar payoffs, and looking for Pareto-optimal behavior.
Stefan Rass +2 more
openaire +1 more source
On codes written by matrices lexicographically ordered
AIP Conference Proceedings, 20186th International Eurasian Conference on Mathematical Sciences and Applications (IECMSA) -- AUG 15-17, 2017 -- Budapest, HUNGARY Certain matrices lexicographically ordered are written using the elements of F-2[u]/(< u3>). The relations between the codes generate by these matrices and Hadamard codes are given.
Ozkan, Mustafa, Oke, Figen
openaire +1 more source
Lexicographic orders and preference representation
Journal of Mathematical Economics, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Global Constraints for Lexicographic Orderings
2002We 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 that decomposing such constraints carries a penalty either in the amount or the cost of constraint propagation. We therefore present a global
Alan Frisch +4 more
openaire +1 more source
Lexicographic order preservation and stochastic dominance
Journal of Multi-Criteria Decision Analysis, 1995AbstractStochastic dominance concerns conditions on outcome probabilities that are necessary and sufficient for one act to be (strictly) preferred to another according to all preference relations that share certain properties, one of which customarily is an Archimedean property sufficient to entail existence of real‐valued representations.
LaValle, Irving H., Fishburn, Peter C.
openaire +2 more sources
Monomials and the Lexicographic Order
1997This paper investigates the relationship between the lexicographic order on monomials and lex-segments of ...
openaire +1 more source