We consider a game-theoretic bin packing problem with identical items, and we study the convergence time to a Nash equilibrium. In the model proposed, users choose their strategy simultaneously. We deal with two bins and multiple bins cases. We consider the case when users know the load of all bins and cases with less information. We consider two approaches, depending if the system can undo mov...

We consider the FIFO Stack-Up problem which arises in delivery industry, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences q1, . . . , qk of labeled bins and a positive integer p. The goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. Each of these pallets h...

Sequences from the DNA barcode region of the mitochondrial COI gene are an effective tool for specimen identification and for the discovery of new species. The Barcode of Life Data Systems (BOLD) (www.boldsystems.org) currently hosts 4.5 million records from animals which have been assigned to more than 490,000 different Barcode Index Numbers (BINs), which serve as a proxy for species. Because ...

We consider the unbalanced allocation of m balls into n bins by a randomized algorithm using the “power of two choices”. For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set. Applications of this generic algorithm range from cost minimization to condensed matter physics. In this paper, we analyze the distribution of the bin loads produced by th...

In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some xed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present the rst unbounded space algorithms for this problem. We also show the rst lower bounds on the asymptotic performance ratio. The case where bins of two sizes, 1 and 2 (0; 1), are ...

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as the optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We also s...

Municipal Solid Waste systems have important economic, social, and environmental impacts for society. Within the diverse stages of reverse logistic chain, waste bin location problem consists in properly locating bins corresponding urban area to store produced by citizens. This stage has a large impact overall efficiency whole system. Thus, several researchers addressed considering different opt...

A consistency/latency tradeoff arises as soon as a distributed storage system replicates data. For low latency, modern storage systems often settle for weak consistency conditions, which provide little, or even worse, no guarantee for data consistency. In this paper we propose the notion of almost strong consistency as a better balance option for the consistency/latency tradeoff. It provides bo...

Smart Bins have appeared in cities all around the world to help manage public waste collection more effectively. How are local governments reacting this piece of technology? Do they serve solely as optimised/glorified receptacles, or contribute than that? Moreover, is there a case further scale up its use across city?