Sciweavers

13414 search results - page 128 / 2683
» The distributed boosting algorithm
Sort
View
AE
1997
Springer
15 years 6 months ago
Asymptotical Convergence Rates of Simple Evolutionary Algorithms under Factorizing Mutation Distributions
Abstract. The standard choice for mutating an individual of an evolutionary algorithm with continuous variables is the normal distribution. It is shown that there is a broad class ...
Günter Rudolph
IPPS
2000
IEEE
15 years 7 months ago
A Quantitative Assessment of Thread-Level Speculation Techniques
Speculative thread-level parallelism has been recently proposed as an alternative source of parallelism that can boost the performance for applications where independent threads a...
Pedro Marcuello, Antonio González
CORR
2007
Springer
108views Education» more  CORR 2007»
15 years 2 months ago
Limited feedback achieves the empirical capacity
The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boo...
Krishnan Eswaran, Anand D. Sarwate, Anant Sahai, M...
124
Voted
IPSN
2004
Springer
15 years 8 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
145
Voted
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
15 years 8 months ago
An Estimation of Distribution Algorithm Based on Maximum Entropy
Estimation of distribution algorithms (EDA) are similar to genetic algorithms except that they replace crossover and mutation with sampling from an estimated probability distributi...
Alden H. Wright, Riccardo Poli, Christopher R. Ste...