Sciweavers

2084 search results - page 417 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
EUROPAR
2005
Springer
13 years 10 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
13 years 5 months ago
Leveraging spatio-temporal redundancy for RFID data cleansing
Radio Frequency Identification (RFID) technologies are used in many applications for data collection. However, raw RFID readings are usually of low quality and may contain many an...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang, Min-Te Su...
TSP
2008
116views more  TSP 2008»
13 years 4 months ago
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory - Part I: Nash Equilibria
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
TCOM
2010
159views more  TCOM 2010»
13 years 3 months ago
Evolutionary cooperative spectrum sensing game: how to collaborate?
—Cooperative spectrum sensing has been shown to be able to greatly improve the sensing performance in cognitive radio networks. However, if cognitive users belong to different se...
Beibei Wang, K. J. Ray Liu, T. Charles Clancy