Results 11 to 20 of about 1,234 (232)
Conditional lexicographic orders in constraint satisfaction problems
Annals of Operations Research, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard J. Wallace, Nic Wilson
openaire +3 more sources
Lexicographic programming for solving security game with fuzzy payoffs and computing optimal deception strategy [PDF]
آیندهپژوهی دفاعی, 2020 Today, security and peace in different parts of society is one of the most important issues of mankind. Especially, due to the expansion of communications, the increase in international flights, and the development of transportation, the need to security
Samaneh Esmaeeli +2 more
doaj +1 more source
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 +1 more source
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 +2 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
Lexicographic choice under variable capacity constraints [PDF]
, 2021 In several matching markets, to achieve diversity, agents' priorities are allowed to vary across an institution's available seats, and the institution is let to choose agents in a lexicographic fashion based on a predetermined ordering of the seats ...
Kemal Yıldız +7 more
core +1 more source
Sums of lexicographically ordered sets
Discrete Mathematics, 1990 Given a set \(A=\{a_ 1,..,a_ n\}\) of distinct positive integers where \(a_ ...
M. D. Atkinson +2 more
openaire +1 more source
Sovremennye Issledovaniâ Socialʹnyh Problem, 2022 The article presents the experience of the authors’ practical work on compiling databases used in documentary linguistics in the study of vocabulary and terminology of office work, which is one of the most pressing problems of Ossetian linguistics ...
Larisa B. Gatsalova +2 more
doaj +1 more source