116 search results - page 2 / 24 » Near optimal online algorithms and fast approximation algori... |
KDD
2009
ACM
13 years 11 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
IAT
2006
IEEE
13 years 11 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
TON
2010
12 years 11 months ago
2010
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
ATAL
2007
Springer
13 years 9 months ago
2007
Springer
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...