Results 11 to 20 of about 215,248 (216)
On lexicographic termination ordering with space bound certifications
, 2001 Colloque avec actes et comité de lecture. internationale.International audienceWe propose a method to analyse the program space complexity, based on termination orderings. This method can be implemented to certify the runspace of programs. We demonstrate
Marion, Jean-Yves +2 more
core +4 more sources
Lexicographic semigroupoids. [PDF]
, 1996 The natural lexicographic semigroupoids associated with Cantor product spaces indexed by countable linear orders are classified. Applications are given to the classification of triangular operator algebras which are direct limits of upper-triangular ...
Power, Stephen C.
core +4 more sources
The Light Lexicographic path Ordering
, 2000 Colloque avec actes et comité de lecture. internationale.International audienceWe introduce syntactic restrictions of the lexicographic path ordering to obtain the Light Lexicographic Path Ordering.
Marion, Jean-Yves, Cichon, Adam
core +4 more sources
Automated static symmetry breaking in constraint satisfaction problems [PDF]
, 2011 Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of additional constraints. This adds
Grayland, Andrews
core +2 more sources
Not mere lexicographic cosmetics: the compilation and structural features of Isichazamazwi SezoMculo [PDF]
, 2009 This article offers a brief overview of the compilation of the Ndebele music terms dictionary, Isichazamazwi SezoMculo (henceforth the ISM), paying particular attention to its struc-tural features.
Nkomo, Dion +5 more
core +2 more sources
On dynamic programming on the values in the semigroup
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2016 For not considered previously discrete optimal control problem with target function values in a linearly ordered Abelian semigroup given characteriza tion of the solvability and on its basis the algorithm seeks optimal process with the help of delivering
Valery G Ovchinnikov
doaj +1 more source
Lexicographic Partial Order [PDF]
Transactions of the American Mathematical Society, 1978 Given a (partially) ordered set P with the descending chain condition, and an ordered set Q , the set
openaire +1 more source
Lexicographic Constrained Multicriteria Ordered Clustering [PDF]
, 2021 Researchers in the multicriteria analysis community have recently started to study the application of clustering techniques. Different methods have been proposed leading to complete or partial multicriteria partitions. Recently, a method based on the exploitation of the ordinal properties of a valued preference relation has been developed in order to ...
Rosenfeld, Jean +2 more
openaire +2 more sources
Enumerating Ordered Trees Lexicographically [PDF]
The Computer Journal, 1985 Summary: A 1-1 mapping between the set of extended ordered trees with n internal nodes and the set of feasible binary bit-patterns with 2n bits is established. By manipulating the feasible bit-patterns, the set of ordered trees with n nodes can be enumerated lexicographically. The ranking and unranking functions are also described.
openaire +3 more sources
Computing a Clique Tree with the Algorithm Maximal Label Search
Algorithms, 2017 The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (
Anne Berry, Geneviève Simonet
doaj +1 more source