Results 131 to 140 of about 3,681 (231)

On maximal order type of the lexicographic product

Logic Journal of the IGPL
Abstract We give a formula for the maximal order type of the lexicographic product of two well partial orders. The proof introduces the notion of a cut of partial order, which might be of independent interest.
openaire   +1 more source

ADAPTIVE REORDERING OF OBSERVATION SPACE TO IMPROVE PATTERN RECOGNITION

TASK Quarterly, 2007
The problem of observation space reordering is presented as a novel approach to pattern recognition based on non-parametric, combinatorial statistical tests. It consists in linearly ordering the elements of a discrete multi-dimensional observation space
JULIUSZ L. KULIKOWSKI
doaj  

Retraction notice to "A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors" [Heliyon 9 (2023) e13925]. [PDF]

Heliyon
Xu S, Shavarani SM, Ghadiri Nejad M, Vizvari B, Toghraie D.   +4 more
europepmc   +1 more source

LexicHash: sequence similarity estimation via lexicographic comparison of hashes. [PDF]

Bioinformatics, 2023
Greenberg G, Ravi AN, Shomorony I.
europepmc   +1 more source

Building genomic data structures from compressed representations using prefix-free parsing. [PDF]

Genome Res
Varki R, Boucher C.
europepmc   +1 more source

Thresholded Lexicographic Ordered Multiobjective Reinforcement Learning

Lexicographic multi-objective problems, which impose a lexicographic importance order over the objectives, arise in many real-life scenarios. Existing Reinforcement Learning work directly addressing lexicographic tasks has been scarce.
Prabhu, Vinayak S., Tercan, Alperen
core  

A simple grammar-based index for finding approximately longest common substrings. [PDF]

Int Symp String Process Inf Retr, 2023
Gagie T, Kashgouli S, Navarro G.
europepmc   +1 more source

Products of Representations Characterize the Products of Dispersions and the Consistency of Beliefs [PDF]

A "dispersion" specifies the relative probability between any two elements of a finite domain. It thereby partitions the domain into equivalence classes separated by infinite relative probability.
Peter A. Streufert
core  

Prefix-free parsing for merging big BWTs. [PDF]

Int Symp String Process Inf Retr
Díaz-Domínguez D, Gagie T, Guerrini V, Langmead B, Lipták Z, Manzini G, Masillo F, Shivakumar V.   +7 more
europepmc   +1 more source

A comparative analysis of crossovers in genetic algorithms for route optimization: case studies from Astana and Shymkent, Kazakhstan. [PDF]

Sci Rep
Kazbek R, Sergaziyev M, Kenzhe D, Raissov A, Yedilkhan D.   +4 more
europepmc   +1 more source