Sciweavers

2542 search results - page 78 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
118
Voted
GECCO
2005
Springer
148views Optimization» more  GECCO 2005»
15 years 8 months ago
An analysis of island models in evolutionary computation
A need for solving more and more complex problems drives the Evolutionary Computation community towards advanced models of Evolutionary Algorithms. One such model is the island mo...
Zbigniew Skolicki
120
Voted
IJCNN
2006
IEEE
15 years 8 months ago
Computational Neurogenetic Modeling: A Methodology to Study Gene Interactions Underlying Neural Oscillations
—We present new results from Computational Neurogenetic Modeling to aid discoveries of complex gene interactions underlying oscillations in neural systems. Interactions of genes ...
Lubica Benuskova, Simei Gomes Wysoski, Nikola K. K...
98
Voted
ARC
2007
Springer
140views Hardware» more  ARC 2007»
15 years 6 months ago
Reconfigurable Computing for Accelerating Protein Folding Simulations
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
Nilton B. Armstrong, Heitor S. Lopes, Carlos R. Er...
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
15 years 8 months ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 6 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...