Voting in Hiring Committees: Which “Almost” Rule is Optimal? [PDF]
Group Decision and Negotiation, 2018 We determine the scoring rule that is most likely to select a high-ability candidate. A major result is that neither the widely used plurality rule nor the inverse-plurality rule are ever optimal, and that the Borda rule is hardly ever optimal ...
Eyal Baharad +2 more
exaly +8 more sources
Almost optimal geometrically local quantum LDPC codes in any dimension [PDF]
Nature CommunicationsGeometrically local quantum codes, comprised of qubits and checks embedded in $${{\mathbb{R}}}^{D}$$ R D with local check operators, have been a subject of significant interest.
Xingjian Li +3 more
doaj +2 more sources
Balanced optimal almost binary sequence pairs of period N≡1（mod4） [PDF]
Tongxin xuebao, 2021 Based on the combinatorial design theory， the constructions of balanced optimal almost binary sequence pairs of period N≡1（mod 4）were researched.The maximal cross-correlation values θc were obtained by different combinations of （almost） binary sequence ...
Xiuping PENG +3 more
doaj +4 more sources
Almost Optimal Searching of Maximal Subrepetitions in a Word
Mathematics, 2022 For some fixed δ such that ...
Roman Kolpakov
doaj +3 more sources
Study on the constructions of optimal almost quaternary sequences with period 2q [PDF]
Tongxin xuebao, 2019 Based on the Chinese remainder theorem and cyclotomic classes of order 4,the constructions of almost quaternary sequences with period N=2q (where q is an odd prime) was studied.According to the number of “0” in the two positions y(0) and y(q),three types
Xiuping PENG +3 more
doaj +4 more sources
Dynamic trees with almost-optimal access cost [PDF]
CoRR, 2018 An optimal binary search tree for an access sequence on elements is a static tree that minimizes the total search cost. Constructing perfectly optimal binary search trees is expensive so the most efficient algorithms construct almost optimal search trees.
Golin, Mordecai +4 more
core +8 more sources
Almost difference sets and their sequences with optimal autocorrelation
IEEE Transactions on Information Theory, 2001 Almost difference sets have interesting applications in cryptography and coding theory. We give a well-rounded treatment of known families of almost difference sets, establish relations between some difference sets and some almost difference sets, and ...
Cunsheng Ding, P Vijay Kumar
exaly +2 more sources
Approximate solution of nonlinear hyperbolic equations with homogeneous jump conditions
Journal of Numerical Analysis and Approximation Theory, 2019 We present the error analysis of class of second order nonlinear hyperbolic interface problem where the spatial and time discretizations are based on finite element method and linearized backward difference scheme respectively. Both semi discrete and
Matthew Olayiwola Adewole
doaj +7 more sources
Optimal Inequalities on (α,β)-Type Almost Contact Manifold with the Schouten–Van Kampen Connection
Axioms, 2023 In the current research, we develop optimal inequalities for submanifolds in trans-Sasakian manifolds or (α,β)-type almost contact manifolds endowed with the Schouten–Van Kampen connection (SVK-connection), including generalized normalized δ-Casorati ...
Mohd Danish Siddiqi, Ali H. Hakami
doaj +1 more source
Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI
IEEE Access, 2019 Rotation symmetric Boolean functions (RSBFs) are nowadays studied a lot because of its easy operations and good performance in cryptosystem. This paper constructs a new class of odd-variable RSBFs with optimal algebraic immunity (AI). The nonlinearity of
Yindong Chen +5 more
doaj +1 more source