A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Lagrangian-based Online Stochastic Bin Packing
2015
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems - SIGMETRICS '15
Preserved Fulltext
Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of online stochastic bin packing under two settings -packing with permanent items, and packing ...
Our algorithm is essentially gradient descent on suitably defined Lagrangian relaxation of the bin packing Linear Program. ...
Review of Bin Packing Literature Online bin packing with infinite collection of bins and permanent items: The Sum of Squares (SS) rule [2, 1] is the current state-of-the-art bin packing policy when item ...
doi:10.1145/2745844.2745897
dblp:conf/sigmetrics/GuptaR15
fatcat:o3v7wbbomrb27pggmkhcbnvs6i
Lagrangian-based Online Stochastic Bin Packing
2015
Performance Evaluation Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of online stochastic bin packing under two settings -packing with permanent items, and packing ...
Our algorithm is essentially gradient descent on suitably defined Lagrangian relaxation of the bin packing Linear Program. ...
Review of Bin Packing Literature Online bin packing with infinite collection of bins and permanent items: The Sum of Squares (SS) rule [2, 1] is the current state-of-the-art bin packing policy when item ...
doi:10.1145/2796314.2745897
fatcat:gdoy4l64mff2roaaqn7zhqddz4
Online Stochastic Bin Packing
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of one-dimensional online stochastic bin packing. ...
Next, we consider the more general problem of online stochastic bin packing with item departures where the time requirement of an item is only revealed when the item departs. ...
There has been an extensive study of heuristics for stochastic online bin packing. ...
arXiv:1211.2687v1
fatcat:btsitxzqundt7nwzbxdj77avyq
Online Bin Packing with Known T
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In the online bin packing problem, a sequence of items is revealed one at a time, and each item must be packed into an available bin instantly upon its arrival. ...
We develop and analyze an adaptive algorithm that solves an offline bin packing problem at geometric time intervals and uses the offline optimal solution to guide online packing decisions. ...
Lagrangian-based; bin size B
Banerjee and Freund (2020) M Int. supp. ...
arXiv:2112.03200v1
fatcat:37nelr2365ftrkvscqaoyk5rby
Backward Chaining
[chapter]
2013
Encyclopedia of Operations Research and Management Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
However, the temporal variation of the term structure is stochastic. ...
A popular choice of discrete models is based on binomial lattices. Such models typically assume that interest rates can move to one of two possible states, up or down, from period t to t + 1. ...
The Sum-of-Squares (SS) algorithm is an online method for packing items with integral sizes into bins of capacity C. It has time complexity O(nC). ...
doi:10.1007/978-1-4419-1153-7_200968
fatcat:wsdsqf2wxrckvpoq4yh5f7rsqm
Optimization-Based Resource Management Algorithms with Considerations of Client Satisfaction and High Availability in Elastic 5G Network Slices
2021
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The proposed Lagrangian relaxation-based approach is adopted to solve the problems at a near-optimal level for increasing the system revenue. ...
The problems are classified as bin-packing and 0/1 knapsack problems. ...
The resource allocation problem is combined with knapsack and bin-packing problems. ...
doi:10.3390/s21051882
pmid:33800232
fatcat:vwt3ajgn2raavhlnz4d2nbj2qe
Overcommitment in Cloud Services -- Bin packing with Chance Constraints
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We introduce and study a model that quantifies the value of overcommitment by modeling the problem as a bin packing with chance constraints. ...
We also develop a family of online algorithms that are intuitive, easy to implement and provide a constant factor guarantee from optimal. ...
In Gupta and Radovanovic (2012) , the authors propose two algorithms based on gradient descent on a suitably defined Lagrangian relaxations of the bin packing linear program that achieve additive O( √ ...
arXiv:1705.09335v1
fatcat:x247fptbmvabjirxqzyf4yhlxu
Analysis of granular flow in a pebble-bed nuclear reactor
2006
Physical Review E
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In the last year of funding, this vision has begun to be realized through a new stochastic formulation of continuum plasticity, based on the notion of spots as "carriers of plastic flow" in granular materials ...
He is working on a new stochastic flow rule for continuum plasticity, based on the concept of spots as "carriers of plasticity", where the random walk of spots is represented by a diffusing order parameter ...
doi:10.1103/physreve.74.021306
pmid:17025418
fatcat:cwpv67uz7nfcxii3uz6gqwffhy
The Repacking Efficiency for Bandwidth Packing Problem
2007
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study its performance by proposing a new formulation of the BPP in the CN, and introducing repacking scheme into next fit algorithm in terms of the online constraint. ...
Repacking is an efficient scheme for bandwidth packing problem (BPP) in centralized networks (CNs), where a central unit allocates bandwidth to the rounding terminals. ...
In this work, we formulate the BPP in the CN that seeks to maximize the bandwidth utilization while keeping the online property. Several repacking algorithms based on NF are proposed for it. ...
doi:10.1093/ietisy/e90-d.7.1011
fatcat:kecmz3jrrne7virzofcpqcejbi
Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds
2012
Transportation Research Record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The heuristic first determines the customers that will be served by each vehicle by use of bin-packing and Lagrangian-based generalized assignment algorithms. ...
The heuristic for the Cap-HTVRP proposed here iteratively finds seed nodes by the use of upper-bound heuristics for the bin-packing problem, assigns a vehicle to each seed node, and then uses a Lagrangian-based ...
doi:10.3141/2283-01
fatcat:kwwbjyq5nbcvtmplqn5nmxrvym
IL-GLOBO (1.0) – development and verification of the moist convection module
2016
Geoscientific Model Development
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The Lagrangian convective scheme is based on the Kain–Fritsch convective parametrization used in GLOBO. ...
The online-coupling promotes the full consistency between the Eulerian and the Lagrangian components of the model. ...
Conclusions A Lagrangian transport scheme for moist convection is implemented online in IL-GLOBO in parallel with the integration of the Eulerian model. ...
doi:10.5194/gmd-9-789-2016
fatcat:rrpwlo2gefc2vkyvsiu2stdojy
Proceedings of the Third Meeting of the EURO Working Group on Operational Research (OR) in Agriculture and Forest Management (EWG-ORAFM)
2008
Journal of Agricultural Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Thus, we have developed a Lagrangian heuristic method based on Lagrangian decomposition (Näsberg 1985 , Guignard 1987 . ...
The presented Lagrangian relaxation-based heuristic divides the problem into sub problems for each time period. ...
doi:10.1017/s0021859608007843
fatcat:skitry3ub5hl5mcs6o2jq5rpwi
Ecohydrological particle model based on representative domains
2018
Hydrology and Earth System Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present the echoRD model (ecohydrological particle model based on representative domains) and a series of application test cases. ...
p>This study extends the fundamental introduction of a space domain random walk of water particles as an alternative approach to the Richards equation for diffusive flow (Zehe and Jackisch 2016) to a stochastic–physical ...
stochastic process is introduced to handle the effect of high diffusivity but the low number of open slots in the pore space near saturation: p counteract = n empty bins n air capacity bins . ( 4 ) Here ...
doi:10.5194/hess-22-3639-2018
fatcat:xwskxw7n4nedppeedcy6pak3fy
Selective Call Out and Real Time Bidding
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We view this selective call out as an online decision problem with bandwidth type constraints. ...
A combination of stochastic and online components similar to this paper appear in [9] , but in the context of load balancing and bin packing. ...
Thus there remains a need for modeling problems which are simultaneously stochastic and online. ...
doi:10.1007/978-3-642-17572-5_12
fatcat:627geewzdvgtrguka2fqqzmuxe
2021 Index IEEE Transactions on Automation Science and Engineering Vol. 18
2021
IEEE Transactions on Automation Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Wang, W., +, TASE Jan. 2021 255-268 Bin packing On the Use of Equivalence Classes for Optimal and Suboptimal Bin Packing and Bin Covering. ...
On the Use of Equivalence Classes for Optimal and Suboptimal Bin Packing and Bin Covering. ...
doi:10.1109/tase.2021.3120615
fatcat:ybfn4kfdvjfipbty7z3mocjjci
« Previous
Showing results 1 — 15 out of 329 results