6542 search results - page 213 / 1309 » The tao of parallelism in algorithms |
145
click to vote
UAI
1997
15 years 8 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
172
click to vote
MST
1998
15 years 6 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
183
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
—The paper is focused on the problem of aggregation of probability distribution applicable for parallel Bivariate Marginal Distribution Algorithm (pBMDA). A new approach based on...
171
click to vote
CPE
1998
Springer
15 years 11 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
162
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
—Detecting anomalies during the operation of a network is an important aspect of network management and security. Recent development of high-performance embedded processing syste...