Sciweavers

3047 search results - page 84 / 610
» Randomized Parallel Selection
Sort
View
PIMRC
2008
IEEE
14 years 4 months ago
Connectivity of wireless ad hoc networks with random beamforming: An analytical approach
Random beamforming, where each node selects a main beam direction without any coordination with other nodes, has been proposed as a simple technique to improve connectivity in wire...
Salman Durrani, Xiangyun Zhou, Haley M. Jones
EC
2007
167views ECommerce» more  EC 2007»
13 years 10 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
ICC
2007
IEEE
123views Communications» more  ICC 2007»
14 years 4 months ago
Channel Access Statistics of Parallel Multiuser Scheduling
— Generalized selection multiuser diversity (GSMuD) is a new scheduling scheme which provides a near-optimal low-complexity solution to parallel access multiuser scheduling. In t...
Yao Ma, Dongbo Zhang
ITC
1998
IEEE
73views Hardware» more  ITC 1998»
14 years 2 months ago
Maximization of power dissipation under random excitation for burn-in testing
This work proposes an approach to generate weighted random patterns which can maximally excite a circuit during its burn-in testing. The approach is based on a probability model a...
Kuo-Chan Huang, Chung-Len Lee, Jwu E. Chen
IJCAI
2007
13 years 11 months ago
Training Conditional Random Fields Using Virtual Evidence Boosting
While conditional random fields (CRFs) have been applied successfully in a variety of domains, their training remains a challenging task. In this paper, we introduce a novel trai...
Lin Liao, Tanzeem Choudhury, Dieter Fox, Henry A. ...