Sciweavers

10901 search results - page 59 / 2181
» Approximations in Distributed Optimization
Sort
View
AAAI
2007
15 years 8 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
16 years 10 days ago
Maximizing Throughput in Layered Peer-to-Peer Streaming
—Layered streaming is an effective solution to address the receiver heterogeneity in peer-to-peer (P2P) multimedia distribution. This paper targets a fundamental challenge in thi...
Liang Dai, Yi Cui, Yuan Xue
AAAI
2004
15 years 7 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
SIGMETRICS
2010
ACM
193views Hardware» more  SIGMETRICS 2010»
15 years 6 months ago
Distributed caching over heterogeneous mobile networks
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a lo...
Stratis Ioannidis, Laurent Massoulié, Augus...
CEC
2009
IEEE
16 years 24 days ago
Enhancing MOEA/D with guided mutation and priority update for multi-objective optimization
—Multi-objective optimization is an essential and challenging topic in the domains of engineering and computation because real-world problems usually include several conflicting...
Chih-Ming Chen, Ying-Ping Chen, Qingfu Zhang