Sciweavers

144 search results - page 2 / 29
» Quality of LP-Based Approximations for Highly Combinatorial ...
Sort
View
INFOCOM
2012
IEEE
11 years 7 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 1 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
HM
2007
Springer
114views Optimization» more  HM 2007»
13 years 9 months ago
Hybrid Numerical Optimization for Combinatorial Network Problems
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
Markus Chimani, Maria Kandyba, Mike Preuss
IPPS
2009
IEEE
14 years 2 days ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
AAAI
2004
13 years 6 months ago
Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
Craig Boutilier, Tuomas Sandholm, Rob Shields