Sciweavers

835 search results - page 56 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
GLOBECOM
2007
IEEE
14 years 5 months ago
Optimizing P2P Streaming Throughput Under Peer Churning
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
Yi Cui, Liang Dai, Yuan Xue
ISITA
2010
13 years 8 months ago
Outage analysis and optimal power allocation for network-coding-based hybrid AF and DF
Network coding was proposed to increase the achievable throughput of multicast in a network. Recently, combining network coding into user cooperation has attracted research attenti...
Jooha Bek, Jaeyoung Lee, Jun Heo
COCO
2004
Springer
93views Algorithms» more  COCO 2004»
14 years 4 months ago
Lower Bounds for Testing Bipartiteness in Dense Graphs
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
Andrej Bogdanov, Luca Trevisan
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 2 months ago
Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulu...
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
14 years 2 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld