Sciweavers

1502 search results - page 84 / 301
» Node weighted scheduling
Sort
View
GLOBECOM
2007
IEEE
13 years 10 months ago
Cooperative Beamforming for Wireless Ad Hoc Networks
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
Lun Dong, Athina P. Petropulu, H. Vincent Poor
ICC
2000
IEEE
153views Communications» more  ICC 2000»
14 years 2 months ago
Collision-Avoidance Transmission Scheduling for Ad-Hoc Networks
Abstract— A novel multichannel schedule-based Medium Access Control (MAC) protocol for ad-hoc networks, named collision-avoidance transmission scheduling (CATS) is introduced. CA...
Zhenyu Tang, J. J. Garcia-Luna-Aceves
DICS
2006
14 years 1 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...
Sebastian Gerlach, Basile Schaeli, Roger D. Hersch
NIPS
1993
13 years 11 months ago
Optimal Stochastic Search and Adaptive Momentum
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
Todd K. Leen, Genevieve B. Orr
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 10 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...