Results 11 to 20 of about 4,545,606 (290)
Almost optimal geometrically local quantum LDPC codes in any dimension [PDF]
Geometrically 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
Optimal Almost-Balanced Sequences
This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms with small redundancy, preferably constant or even a single bit, for almost balanced sequences has remained unsolved.
Daniella Bar-Lev +3 more
openaire +5 more sources
Dynamic Trees with Almost-Optimal Access Cost [PDF]
info:eu-repo/semantics ...
Mordecai J. Golin +4 more
core +9 more sources
Almost sure exponential stabilisation of stochastic systems by state-feedback control [PDF]
So far, a major part of the literature on the stabilisation issues of stochastic systems has been dedicated to mean square stability. This paper develops a new class of criteria for designing a controller to stabilise a stochastic system almost surely ...
Mao, Xuerong, Hu, Liangjian
core +4 more sources
Almost sure exponential stability of numerical solutions for stochastic delay differential equations [PDF]
Using techniques based on the continuous and discrete semimartingale convergence theorems, this paper investigates if numerical methods may reproduce the almost sure exponential stability of the exact solutions to stochastic delay differential equations (
Szpruch, Lukasz, Wu, Fuke, Mao, Xuerong
core +4 more sources
Optimal cost almost-sure reachability in POMDPs [PDF]
We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with ...
Chatterjee, Krishnendu +3 more
openaire +5 more sources
Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI
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
Balanced optimal almost binary sequence pairs of period N≡1(mod4)
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 +2 more sources
For the assumed bale volume, its dimensions (diameter, height), minimizing the consumption of the plastic film used for bale wrapping with the combined 3D method, depend on film and wrapping parameters.
Anna Stankiewicz
doaj +1 more source
Almost optimal manipulation of a pair of alternatives
The role of an expert in the decision-making process is crucial, as the final recommendation depends on his disposition, clarity of mind, experience, and knowledge of the problem. However, the recommendation also depends on their honesty. But what if the expert is dishonest?
Jacek Szybowski +2 more
openaire +2 more sources

