Sciweavers

628 search results - page 68 / 126
» Designing the perfect auction
Sort
View
FCT
2007
Springer
14 years 1 months ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee
ACTA
2008
136views more  ACTA 2008»
13 years 10 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee
TCOM
2010
91views more  TCOM 2010»
13 years 8 months ago
Robust Power Allocation Algorithms for Wireless Relay Networks
—Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algori...
Tony Q. S. Quek, Moe Z. Win, Marco Chiani
HPCC
2011
Springer
12 years 9 months ago
Achieving Performance and Availability Guarantees with Spot Instances
Abstract—In the Infrastructure-as-a-Service (IaaS) cloud computing market, spot instances refer to virtual servers that are rented via an auction. Spot instances allow IaaS provi...
Michele Mazzucco, Marlon Dumas
INFOCOM
2007
IEEE
14 years 4 months ago
Iterative Scheduling Algorithms
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Ma...