Results 21 to 30 of about 5,532 (307)
Two New Classes of Codebooks Asymptotically Achieving the Welch Bound
Exponential sums over Galois rings have many applications in coding theory, cryptography and algebraic combinatorics. In this article, we employ additive characters and multiplicative characters over Galois rings to present two classes of codebooks, and ...
Shimin Sun, Li Han, Yang Yan, Yao Yao
doaj +1 more source
Asymptotically Optimal Covering Designs
A (v,k,t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size}, and the minimum size of such a covering is denoted by C(v,k,t).
Gordon, Daniel +3 more
openaire +3 more sources
Asymptotically Optimal Gathering on a Grid [PDF]
arXiv admin note: substantial text overlap with arXiv:1510 ...
Andreas Cord-Landwehr +3 more
openaire +2 more sources
Optimistic Agents Are Asymptotically Optimal [PDF]
We use optimism to introduce generic asymptotically optimal reinforcement learning agents. They achieve, with an arbitrary finite or compact class of environments, asymptotically optimal behavior. Furthermore, in the finite deterministic case we provide finite error bounds.
Peter Sunehag, Marcus Hutter
openaire +2 more sources
In the context of clinical trials for comparing two treatments, a new class of covariate adjusted response adaptive procedures is developed to achieve a balance between clinical optimality and inferential precision.
Rahul Bhattacharya, Uttam Bandyopadhyay
doaj +1 more source
Asymptotically Optimal Codebooks Derived From Generalised Bent Functions
Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing.
Qiuyan Wang, Yang Yan
doaj +1 more source
In this paper, we propose a model averaging estimation for the varying-coefficient partially linear models with missing responses. Within this context, we construct a HRCp weight choice criterion that exhibits asymptotic optimality under certain ...
Jie Zeng, Weihu Cheng, Guozhi Hu
doaj +1 more source
We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for ...
Tao Ren +4 more
doaj +1 more source
Combining Multiple Strategies for Multiarmed Bandit Problems and Asymptotic Optimality
This brief paper provides a simple algorithm that selects a strategy at each time in a given set of multiple strategies for stochastic multiarmed bandit problems, thereby playing the arm by the chosen strategy at each time. The algorithm follows the idea
Hyeong Soo Chang, Sanghee Choe
doaj +1 more source
Estimation of Gini Index within Pre-Specified Error Bound
Gini index is a widely used measure of economic inequality. This article develops a theory and methodology for constructing a confidence interval for Gini index with a specified confidence coefficient and a specified width without assuming any specific ...
Bhargab Chattopadhyay +1 more
doaj +1 more source

