In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bo...

The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems is suggested: (a) basic element sets (item set, bin set, item subset assigned to bin), (b) binary relation over the sets: relation over item set as compatib...

Unlike most previous studies on Buy-It-Now (BIN) auctions, this study investigates factors that affect the level of use of BIN auctions by sellers. This study proposes a conceptual model in which product types and culture are two important factors affecting sellers’ decisions on the level of use of BIN auctions. The empirical investigation exhibits that sellers of homogeneous products are more ...

We present a new histogram feature for regionbased tracking, which we refer as sparstogram. Firstly, we introduce some new concepts such as bin region and edge complexity. A bin region consists of the pixels falling in the corresponding histogram bin, and edge complexity denotes a ratio of the circumference to the area of bin region. Then, we propose our feature based on conventional histogram ...

Bin, r, k) = 0 fo r k > n, B(n9 r9 0) = 0 , Bin, r, 1) = r(r + l ) . . . ( p + n 1 ) , Bin, v, ri) = v and Bin, ls k) = \L(n9 k) | , t h e s i g n l e s s Lah numbers ( see Riordan [ 1 2 ] , p . 4 4 ) . Ahuja & Enneking have a l s o ob ta ined (see [2]) t he fo l lowing r e l a t i o n s for t he B(n9 r9 k)'s: Bin + 1, v9 k) = in + rk)B(n9 v9 k) + vBin, r, k 1 ) , (2) and [Bin9 v9 k)] > Bin, v,...

Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with variable sized bins, we are given a supply of a variety of sizes. This latter model assumes, however, that the cost of a bin is always defined to be its exact size. In this paper we study the more general problem wher...

We continue the study of two recently introduced bin packing type problems, called with clustering, and online delays. A input consists items sizes not larger than 1, goal is to partition or pack them into bins, where total size every valid cannotexceed 1. In also have colors associated them. globally optimal solution can combine different while a clustered only monochromatic bins. The compare ...

When analyzing neuron spike trains, it is always the problem of how to set the time bin. Bin width affects much to analyzed results of such as periodicity of the spike trains. Many approaches have been proposed to determine the bin setting. However, these bins are fixed through the analysis. In this paper, we propose a randomizing method of bin width and location instead of conventional fixed b...

In the bin packing problem, we get a sequence of packets of size r 1 ; r 2 ; r 3 ; : : :, each r i 1, and we must place the packets into bins of size 1 using as few bins as possible. The size of a bin is the accumulated size of all packets in the bin, and the free capacity of a bin is 1 minus its size.