Sciweavers

3415 search results - page 477 / 683
» Lower bounds on kernelization
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Price of Anarchy in Non-Cooperative Load Balancing
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
Urtzi Ayesta, Olivier Brun, Balakrishna Prabhu
INFOCOM
2010
IEEE
15 years 5 months ago
Capacity Region of a Wireless Mesh Backhaul Network over the CSMA/CA MAC
—This paper studies the maximum throughput that can be supported by a given wireless mesh backhaul network, over a practical CSMA/CA medium access control (MAC) protocol. We reso...
Yu Cheng, Hongkun Li, Peng-Jun Wan, Xinbing Wang
PVLDB
2010
84views more  PVLDB 2010»
15 years 4 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
SIGPRO
2010
99views more  SIGPRO 2010»
15 years 4 months ago
Oversampled phase tracking in digital communications with large excess bandwidth
This paper deals with the on-line carrier phase estimation in a digital receiver. We consider a Brownian phase evolution in a Data Aided scenario. The proposed study uses an overs...
Jordi Vilà-Valls, Jean-Marc Brossier, Laure...
TCS
2010
15 years 4 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt