Abstract. We consider the average case behavior of one-dmensional bin paekmg algorithms in the case where bins have unit capacity and item sizes are chosen according to the ‘ ‘dficrete uniform ” distribution U~; k), 1 s j < k, where each item size in the set {llk,21k,..., ji k) has probability 1/j of beiig chosen. Note that for fixed j,k the distributions U{?nj;mk] ’ approach the continuous distribution U(O, jlk] as m A W, where in U(O, jl k] the item sizes are chosen uniformly horn the half-open interval (O,jik]. In this paper, we show that average case behavior can differ substantially under the two types of distributions. We show that for all j, k, j < k-1, there exist on-line algorithms that have constant expected waste under U~; ...
Simple continuous estimation of distribution algorithms are applied to a benchmark real-world set of...
Abstract. Simple continuous estimation of distribution algorithms are applied to a benchmark real-wo...
Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is know...
Abstract. We consider the one-dimensional bin packing problem with unit-capacity bins and item sizes...
We analyze the one-dimensional bin-packing problem under the assumption that bins have unit capacity...
(eng) We study of the average case performance of the Best Fit algorithm for on-line bin packing und...
ABSTRACT: We prove that Best Fit bin packing has linear waste on the discrete distribution U{j, k} (...
Many complex proesses can be modeled by (countably) infinite, multidimensional Markov chains. Unfort...
We prove that the First Fit bin packing algorithm is stable under the input distribution Ufk \Gamma...
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k − 2, k}...
We prove that the First Fit bin packing algorithm is stable under the input distribution Ufk 2; kg ...
In the bin packing problem, a list L of n items is to be packed into a sequence of unit capacity bin...
Recent research in combinatorial bin-packing models is extended to a stochastic model in which an ar...
In these notes we introduce Levin’s theory of average-case complexity. This theory is still in its i...
AbstractThe average-case analysis of algorithms usually assumes independent, identical distributions...
Simple continuous estimation of distribution algorithms are applied to a benchmark real-world set of...
Abstract. Simple continuous estimation of distribution algorithms are applied to a benchmark real-wo...
Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is know...
Abstract. We consider the one-dimensional bin packing problem with unit-capacity bins and item sizes...
We analyze the one-dimensional bin-packing problem under the assumption that bins have unit capacity...
(eng) We study of the average case performance of the Best Fit algorithm for on-line bin packing und...
ABSTRACT: We prove that Best Fit bin packing has linear waste on the discrete distribution U{j, k} (...
Many complex proesses can be modeled by (countably) infinite, multidimensional Markov chains. Unfort...
We prove that the First Fit bin packing algorithm is stable under the input distribution Ufk \Gamma...
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k − 2, k}...
We prove that the First Fit bin packing algorithm is stable under the input distribution Ufk 2; kg ...
In the bin packing problem, a list L of n items is to be packed into a sequence of unit capacity bin...
Recent research in combinatorial bin-packing models is extended to a stochastic model in which an ar...
In these notes we introduce Levin’s theory of average-case complexity. This theory is still in its i...
AbstractThe average-case analysis of algorithms usually assumes independent, identical distributions...
Simple continuous estimation of distribution algorithms are applied to a benchmark real-world set of...
Abstract. Simple continuous estimation of distribution algorithms are applied to a benchmark real-wo...
Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is know...