Results 31 to 40 of about 5,532 (307)
Asymptotically optimal minimizers schemes [PDF]
Bioinformatics, 2018 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 +2 more sources
Non-linear and signal energy optimal asymptotic filter design [PDF]
Journal of Systemics, Cybernetics and Informatics, 2003 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
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2007 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 frugal colouring [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Molloy 0001, Bruce A. Reed
openaire +2 more sources
On Asymptotically Optimal Tests
The Annals of Statistics, 1977 Sequences of tests with error $\exp(-nA)$ of the first type are investigated. It is shown that the error of the second type of such a sequence of tests is bounded by $\exp(- nB)$ where $B$ is determined by the Kullback-Leibler information distance of the hypotheses tested.
openaire +3 more sources
Update on the Asymptotic Optimality of LPT [PDF]
, 2021 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
Asymptotically Optimal Adversarial Strategies for the Probability Estimation Framework
Entropy, 2023 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
Stochastic Systems, 2015 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
Scientific Reports, 2023 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
Asymptotic Optimality in Byzantine Distributed Quickest Change Detection
, 2021 :The Byzantine distributed quickest change detection (BDQCD) is studied, where a fusion center monitors the occurrence of an abrupt event through a bunch of distributed sensors that may be compromised.
Lin, Shih-Chun, Huang, Yu-Jui
core +1 more source