Results 71 to 80 of about 70,986 (246)
On the diversity of test instances for studying branch‐and‐bound performance
Australian &New Zealand Journal of Statistics, EarlyView.Summary In their paper ‘An Automatic Method for Solving Discrete Programming Problems’, Ailsa Land and Alison Doig developed a branch‐and‐bound method for solving the general case of the mixed integer linear programming (MIP) problem. A core part of the algorithm, branch variable selection, has received renewed attention in recent years with the ...
Simon Bowly, Kate Smith‐Miles
wiley +1 more source
Horse Ammunition. From the History of a Saddle
Вестник Волгоградского государственного университета. Серия 4. История, регионоведение, международные отношения, 2019 Introduction. Horse ammunition was formed historically on a large geographical area. The most important component of it is a saddle. The ancient history of a saddle is not sufficiently investigated.
Sergey I. Lukyashko
doaj +1 more source
Exponents of the primitive Boolean matrices with fixed girth [PDF]
arXiv, 2015 The $girth$ of a primitive Boolean matrix is defined to be the $girth$ of its associated digraph. In this paper, among all primitive Boolean matrices of order $n$, the primitive exponents of those of girth $g$ are considered. For the primitive matrices of both order $n\geq 10$ and girth $g>\frac{n^{2}-4n}{4(n-3)}$, the matrices with primitive exponents
arxiv
Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs [PDF]
arXiv, 2021 This paper gives necessary and sufficient conditions for the Tanner graph of a quasi-cyclic (QC) low-density parity-check (LDPC) code based on the all-one protograph to have girth 6, 8, 10, and 12, respectively, in the case of parity-check matrices with column weight 4.
arxiv
Closing the air gap: the use of drones for studying wildlife ecophysiology
Biological Reviews, EarlyView.ABSTRACT Techniques for non‐invasive sampling of ecophysiological data in wild animals have been developed in response to challenges associated with studying captive animals or using invasive methods. Of these, drones, also known as Unoccupied Aerial Vehicles (UAVs), and their associated sensors, have emerged as a promising tool in the ecophysiology ...
Adam Yaney‐Keller +3 more
wiley +1 more source
Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation
Tongxin xuebao, 2017 Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 ...
Qing ZHU +4 more
doaj
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
Discussiones Mathematicae Graph Theory, 2022 A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k.
Axenovich Maria, Karrer Annette
doaj +1 more source
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [PDF]
Transactions on Combinatorics, 2012 S. Kim, et al, have been analyzed the girth of some algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes, i.e. Tanner (3,5) of length 5p, where p is a prime of the form 15m+1. In this paper, by extension this method to Tanner (
Mohammad Gholami +1 more
doaj
The Bankruptcy Reform Process: Maximizing Judicial Control in Wage Earners\u27 Plans [PDF]
, 1977 This article examines the effort to maximize judicial control over the bankruptcy process and its impact on H.R. 8200\u27s procedural requirements for the nonbusiness bankruptcy option known currently as the wage earners\u27 plan.
Girth, Marjorie
core +1 more source
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth [PDF]
, 2018 The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large
arxiv +1 more source