Results 31 to 40 of about 358,125 (307)
Non-linear and signal energy optimal asymptotic filter design [PDF]
The paper studies some connections between the main results of the well known Wiener-Kalman-Bucy stochastic approach to filtering problems based mainly on the linear stochastic estimation theory and emphasizing the optimality aspects of the achieved ...
Josef Hrusak, Vaclav Cerny
doaj
THE AVERAGING METHOD OF BOUNDARY-VALUE PROBLEMS IN CONTROL OF FAST AND SLOW VARIABLES WITH DELAY
Initial problem of terminal control with delay and variables with velocity orders of unity and small parameter in view of necessary optimality condition is reduced to perturbed boundary-value problem with deviating arguments.
V.P. Zholtikov, V.V. Efendiev
doaj +1 more source
Asymptotically optimal minimizers schemes [PDF]
Abstract Motivation The minimizers technique is a method to sample k -mers that is used in many bioinformatics software to reduce computation, memory usage and run time. The number of applications using minimizers keeps on growing steadily.
Marçais, Guillaume +2 more
openaire +3 more sources
Asymptotic properties of a goodness-of-fit test based on maximum correlations [PDF]
We study the efficiency properties of the goodness-of-fit test based on the Qn statistic introduced in Fortiana and Grané (2003) using the concepts of Bahadur asymptotic relative efficiency and Bahadur asymptotic optimality.
Tchirina, Anna V., Grané Chávez, Aurea
core +1 more source
Asymptotically optimal frugal colouring [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Molloy 0001, Bruce A. Reed
openaire +3 more sources
Update on the Asymptotic Optimality of LPT [PDF]
Lorsque l’on doit ordonnancer des tâches indépendantes sur des processeurs identiques, l’objectif habituel est de minimiser le makespan, c’est-à-dire le temps total d’exécution. Une heuristique simple et efficace consiste à ordonnancer d’abord la tâche avec le plus long temps de calcul (heuristique LPT), et de prévoir son exécution le plus tôt possible.
Benoit, Anne +3 more
openaire +3 more sources
We consider a queueing system composed of a dispatcher that routes jobs to a set of non-observable queues working in parallel. In this setting, the fundamental problem is which policy should the dispatcher implement to minimize the stationary mean ...
Jonatha Anselmi +2 more
doaj +1 more source
Asymptotically Optimal Adversarial Strategies for the Probability Estimation Framework
The probability estimation framework involves direct estimation of the probability of occurrences of outcomes conditioned on measurement settings and side information. It is a powerful tool for certifying randomness in quantum nonlocality experiments. In
Soumyadip Patra, Peter Bierhorst
doaj +1 more source
Asymptotically optimal Boolean functions [PDF]
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $ρ_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions.
openaire +3 more sources
In this paper, we study non-Bayesian and Bayesian estimation of parameters for the Kumaraswamy distribution based on progressive Type-II censoring. First, the maximum likelihood estimates and maximum product spacings are derived.
Osama E. Abo-Kasem +2 more
doaj +1 more source

