Results 111 to 120 of about 3,681 (231)
Incremental Tree-Based Missing Data Imputation with Lexicographic Ordering
, 2009 Missing data, Classification and regression tree, FAST splitting algorithm, Lexicographic order, Nonparametric imputation, Data editing,
Roberta Siciliano +5 more
core +1 more source
Primitivity testing in free group algebras via duality
Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.Abstract Let K$K$ be a field and F$F$ a free group. By a classical result of Cohn and Lewin, the free group algebra KF$K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a well‐defined rank. Given a finitely generated right ideal I⩽KF$I\leqslant K\left[F\right]$ and an element f∈I$f\
Matan Seidel +2 more
wiley +1 more source
KONSTRUKSI LEXICOGRAPHIC UNTUK MEMBANGUN KODE HAMMING (7, 4, 3) [PDF]
, 2009 Hamming code can correct single error in massages transmission. Hamming codes can be constructed by Lexicographic codes. Lexicographic construction is a greedy algorithm that produces error correcting codes known as lexicographic codes.
Aini, Aurora Nur +3 more
core
Score sequences: Lexicographic enumeration and tournament construction
, 1988 In this paper we give an algorithm for generating all tournament score sequences of a given length in lexicographic order.
Gervacio, S.V.
core +1 more source
Lexicographic decomposition of preferences
, 2013 International audienceThe Ordinal Lexicographic Model, based on the lexicographic sum of relations, provides an explanation to intransitivities in preferences as shifts in choice criteria.
Charon, Irène, Hudry, Olivier
core
Hamiltonian Decomposition of Lexicographic Products of Digraphs
, 1998 We partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexicographic product of two hamiltonian decomposable digraphs, the first of odd order, is itself hamiltonian decomposable in ...
Ng, Lenhard L.
core +1 more source
Prudent Rationalizability in Generalized Extensive-Form Games [PDF]
We define an extensive-form analogue of iterated admissibility, called Prudent Rationalizability (PR). In each round of the procedure, for each information set of a player a surviving strategy of hers is required to be rational vis-a-vis a belief system ...
Aviad Heifetz +2 more
core
Stochastic Games with Lexicographic Reachability-Safety Objectives
, 2020 We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness
Weininger, Maximilian +3 more
core +1 more source
l. GENERATING ALL SUBSETS OF {1,..., z} IN LEXICOGRAPHIC ORDER
, 1986 On the basis ol a backtrack procedure for lexicographic enumeration of all subsets of a set of n elemcnts, we giue an algorithm both for determining all bases consisting offunctions from a giaen complete set in a considered sabset of the set of k-ualued ...
I. Stojmenovif, Enp M. Miyakawat
core
Conditions for generic initial ideals to be almost reverse lexicographic
, 2008 Let I be a homogeneous Artinian ideal in a polynomial ring R=k[x1,…,xn] over a field k of characteristic 0. We study an equivalent condition for the generic initial ideal gin(I) with respect to reverse lexicographic order to be almost reverse ...
Park, Jung Pil, Cho, Young Hyun
core +1 more source