نتایج جستجو برای: random packing
تعداد نتایج: 305030 فیلتر نتایج به سال:
2011
Richard Beigel
Bin Fu
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1, . . . , an in (0, 1]. Using uniform sampling, which selects a random element from the input list each time, we develop a randomized O( n)(log log n) ∑n i=1 ai +( 1 2 ) 1 2 ) time (1+2)approximation scheme for the bin packing problem. We show that every randomized algorithm with unifo...
Journal:
:CrystEngComm
2018
Journal:
:Physica A: Statistical Mechanics and its Applications
2005
Journal:
:ESAIM: Proceedings
2009
Journal:
:Random Structures and Algorithms
2000
Journal:
:Physical Review E
2014
Journal:
:Séminaire de théorie spectrale et géométrie
1997
Journal:
:Journal of Physics C: Solid State Physics
1986
Journal:
:Physical Review Letters
2012
Journal:
:Advances in Applied Probability
1992
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید