Sciweavers

2542 search results - page 328 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
14 years 4 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 4 months ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
ICA
2007
Springer
14 years 4 months ago
Comparative Speed Analysis of FastICA
FastICA is arguably one of the most widespread methods for independent component analysis. We focus on its deflation-based implementation, where the independent components are ext...
Vicente Zarzoso, Pierre Comon
ISSAC
2007
Springer
147views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Differential equations for algebraic functions
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
Alin Bostan, Frédéric Chyzak, Bruno ...
OTM
2007
Springer
14 years 4 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra