Sciweavers

64 search results - page 10 / 13
» Bin Packing with Fixed Number of Bins Revisited
Sort
View
82
Voted
4OR
2004
90views more  4OR 2004»
14 years 9 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
IJES
2006
110views more  IJES 2006»
14 years 9 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar
INFOCOM
2011
IEEE
14 years 1 months ago
Consolidating virtual machines with dynamic bandwidth demand in data centers
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
Meng Wang, Xiaoqiao Meng, Li Zhang 0002
EOR
2006
83views more  EOR 2006»
14 years 9 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
VLDB
2005
ACM
93views Database» more  VLDB 2005»
15 years 3 months ago
Revisiting Pipelined Parallelism in Multi-Join Query Processing
Multi-join queries are the core of any integration service that integrates data from multiple distributed data sources. Due to the large number of data sources and possibly high v...
Bin Liu, Elke A. Rundensteiner