Sciweavers

1778 search results - page 16 / 356
» On the Power of the Randomized Iterate
Sort
View
ITC
1998
IEEE
73views Hardware» more  ITC 1998»
15 years 10 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
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
15 years 12 months ago
Networks preserving evolutionary equilibria and the power of randomization
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
Michael S. Kearns, Siddharth Suri
TMC
2012
13 years 8 months ago
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
Hyang-Won Lee, Eytan Modiano, Long Bao Le
MSWIM
2006
ACM
15 years 12 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
WALCOM
2008
IEEE
127views Algorithms» more  WALCOM 2008»
15 years 7 months ago
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...