Results 221 to 230 of about 656,245 (262)
Numerical modeling to enhance the efficiency of experimentally fabricated Sb<sub>2</sub>Se<sub>3</sub>-based solar cell. [PDF]
RSC AdvChowdhury TA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Combinatorica, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +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
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
Almost Optimal Explicit Selectors
2005We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, if A ∩ B = {z}, then element z∈ A is selected by set B. Selectors are such families $\mathcal{S}$ of sets B of some domain that allow to select many elements from sufficiently
Bogdan S. Chlebus, Dariusz R. Kowalski
openaire +1 more source