Results 291 to 300 of about 8,222,439 (341)
Perceptions of Optimal Post-Malnutrition Weight Gain & Growth: a global mixed methods study
O’Donovan G +12 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number
ACM Conference on Economics and Computation, 2023The existence of EFX allocations is a fundamental open problem in discrete fair division. Since the general problem has been elusive, progress is made on two fronts: (i) proving existence when the number of agents is small, and (ii) proving the existence
Hannaneh Akrami +5 more
semanticscholar +1 more source
Optimal and Almost-Optimal Golay-ZCZ Sequence Sets With Bounded PAPRs
IEEE Transactions on Communications, 2023This paper aims to present novel constructions of Golay-ZCZ sequence sets with various set sizes and flexible lengths. A Golay-ZCZ sequence set is not only a Golay complementary set (GCS) but also a zero correlation zone (ZCZ) sequence set.
Cheng-Yu Pai, Yu-Jen Lin, Chao-Yu Chen
semanticscholar +1 more source
Almost Robust Discrete Optimization
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Opher Baron +3 more
openaire +1 more source
SIAM Journal on Computing, 2007
We present an $O(\lg \lg n)$-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of $O(\lg n)$. This is the first major progress on Sleator and Tarjan’s dynamic optimality conjecture of 1985 that $O(1)$-competitive binary search trees exist.
Demaine, Erik D. +3 more
openaire +1 more source
We present an $O(\lg \lg n)$-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of $O(\lg n)$. This is the first major progress on Sleator and Tarjan’s dynamic optimality conjecture of 1985 that $O(1)$-competitive binary search trees exist.
Demaine, Erik D. +3 more
openaire +1 more source
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
International Colloquium on Automata, Languages and Programming, 2020A mobile agent navigating along edges of a simple connected graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task is known as treasure hunt.
S. Bouchard +3 more
semanticscholar +1 more source
Fast Construction of Almost Optimal Symbol Distributions for Asymmetric Numeral Systems
International Symposium on Information Theory, 2019A crucial task in the design of an efficient ANS encoder consists in choosing a favourable symbol distribution. This task seems to be hard, due to its combinatorial nature, in particular for the tANS variant of ANS, which is the focus of this work.
Danny Dubé, H. Yokoo
semanticscholar +1 more source
Almost optimal policies for stochastic systemswhich almost satisfy conservation laws
Annals of Operations Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Glazebrook KD, Garbe R
openaire +3 more sources
IEEE Transactions on Information Theory, 2019
This paper considers the construction of resilient Boolean functions on an odd number of variables with strictly almost optimal (SAO) nonlinearity. Through introducing the fragmentary Walsh transform, a construction technique called “High-Meets-Low” is ...
Weiguo Zhang
semanticscholar +1 more source
This paper considers the construction of resilient Boolean functions on an odd number of variables with strictly almost optimal (SAO) nonlinearity. Through introducing the fragmentary Walsh transform, a construction technique called “High-Meets-Low” is ...
Weiguo Zhang
semanticscholar +1 more source
ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS
International Journal of Computational Geometry & Applications, 2010We implement an algorithm for k-clustering for small k in fixed dimensions and report experimental results here. Although the theoretical bounds on the running time are hopeless for 1 + ∊ approximating k-clusters, we note that for dimensions 2 and 3, k-clustering is practical for small k (k ≤ 4) and simple enough shapes. For the purposes of this paper,
Kumar, Pankaj, Kumar, Piyush
openaire +2 more sources