Sciweavers

17760 search results - page 208 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
2005
Springer
15 years 10 months ago
On the practical genetic algorithms
This paper offers practical design-guidelines for developing efficient genetic algorithms (GAs) to successfully solve realworld problems. As an important design component, a prac...
Chang Wook Ahn, Sanghoun Oh, Rudrapatna S. Ramakri...
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 8 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 5 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
EMMCVPR
2009
Springer
15 years 11 months ago
Image Registration under Varying Illumination: Hyper-Demons Algorithm
Abstract. The goal of this paper is to present a novel recipe for deformable image registration under varying illumination, as a natural extension of the demons algorithm. This gen...
Mehran Ebrahimi, Anne L. Martel
AE
2007
Springer
15 years 10 months ago
On the Design of Adaptive Control Strategies for Evolutionary Algorithms
This paper focuses on the design of control strategies for Evolutionary Algorithms. We propose a method to encapsulate multiple parameters, reducing control to only one criterion. ...
Jorge Maturana, Frédéric Saubion