Results 211 to 220 of about 10,214,423 (243)
Some of the next articles are maybe not open access.
Iterative Lexicographic Path Orders
2006We relate Kamin and Levy’s original presentation of lexicographic path orders (LPO), using an inductive definition, to a presentation, which we will refer to as iterative lexicographic path orders (ILPO), based on Bergstra and Klop’s definition of recursive path orders by way of an auxiliary term rewriting sytem.
Jan Willem Klop +2 more
openaire +3 more sources
Matrices with lexicographically-ordered rows
Optimization Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
The worst order in not always the lexicographic order
ACM SIGSAM Bulletin, 1991Consider I an homogeneous ideal in S = k [ x 0 ,..., x n ], where k is a field of characteristic zero. For any multiplicative order > on
openaire +1 more source
The Web Conference, 2010
We continue the line of research on graph compression started with WebGraph, but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the approaches that have been used for a long time to compress web graphs rely
P. Boldi +3 more
semanticscholar +1 more source
We continue the line of research on graph compression started with WebGraph, but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the approaches that have been used for a long time to compress web graphs rely
P. Boldi +3 more
semanticscholar +1 more source
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 M. Frisch +4 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
On codes written by matrices lexicographically ordered
AIP Conference Proceedings, 2018Certain 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
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
Monomials and the Lexicographic Order
1997This paper investigates the relationship between the lexicographic order on monomials and lex-segments of ...
openaire +1 more source