Sciweavers

1380 search results - page 97 / 276
» Computing the optimal strategy to commit to
Sort
View
TIT
2010
102views Education» more  TIT 2010»
13 years 2 months ago
On instantaneous relaying
Abstract--The Gaussian, three-node relay channel with orthogonal receive components (i.e., the transmitted signals from the source and the relay do not interfere with each other) i...
Majid Nasiri Khormuji, Mikael Skoglund
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 9 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
CONEXT
2010
ACM
13 years 5 months ago
Optimal content placement for a large-scale VoD system
IPTV service providers offering Video-on-Demandcurrently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes...
David Applegate, Aaron Archer, Vijay Gopalakrishna...
HEURISTICS
2002
99views more  HEURISTICS 2002»
13 years 7 months ago
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
AAAI
2004
13 years 9 months ago
GROWRANGE: Anytime VCG-Based Mechanisms
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
David C. Parkes, Grant Schoenebeck