Results 261 to 270 of about 701,199 (295)
Distributional Effects of Optimal Commodity Taxes With Minimum Income Programs: Micro-Simulations for Brazil [PDF]
Seki Asano +3 more
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +3 more sources
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 +3 more sources
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
An almost optimal algorithm for unbounded searching [PDF]
Information Processing Letters, 1976 Jon Louis Bentley, Andrew Chi-Chih Yao
exaly +2 more sources
The complexity of almost-optimal simultaneous coordination
Algorithmica, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rida A. Bazzi, Gil Neiger
openaire +1 more source
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
Almost optimal polyhedral separators
Proceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994We animate two deterministic polynomial time methods for finding a separator for two nested convex polyhedra in 3d. While this problem is NP-complete, we show a reduction to set cover. We then animate the greedy method and the weighted method.
openaire +1 more source
Almost optimal permutation routing on hypercubes
Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001This paper deals with permutation routing on hypercube networks in the store-and-forward model. We introduce the first (on-line and off-line) algorithms routing any permutation on the d-dimensional hypercube in d+o(d) steps. The best previously known results were 2d+o(d) (oblivious on-line) and 2d-3 (off-line).
openaire +2 more sources
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 for Bin Coloring Problems
Journal of Combinatorial Optimization, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingen Lin, Zhiyong Lin, Jinhui Xu 0001
openaire +2 more sources