Sciweavers

3047 search results - page 80 / 610
» Randomized Parallel Selection
Sort
View
ICDCS
2008
IEEE
14 years 4 months ago
Enabling Accurate Node Control in Randomized Duty Cycling Networks
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
Kang-Won Lee, Vasileios Pappas, Asser N. Tantawi
ISPAN
1999
IEEE
14 years 2 months ago
Sparse Networks Tolerating Random Faults
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
Toshinori Yamada, Shuichi Ueno
RSA
2000
170views more  RSA 2000»
13 years 9 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
PPSN
1998
Springer
14 years 2 months ago
On Risky Methods for Local Selection under Noise
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
Günter Rudolph
PPSN
1994
Springer
14 years 2 months ago
Convergence Models of Genetic Algorithm Selection Schemes
We discuss the use of normal distribution theory as a tool to model the convergence characteristics of di erent GA selection schemes. The models predict the proportion of optimal a...
Dirk Thierens, David E. Goldberg