2681 search results - page 439 / 537 » Problem F |
112
click to vote
SPAA
2010
ACM
15 years 22 hour ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
126
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
170
click to vote
PODS
2011
ACM
14 years 2 months ago
2011
ACM
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
136
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
116
click to vote
MOBICOM
2012
ACM
13 years 2 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...