Sciweavers

12264 search results - page 156 / 2453
» An Analysis of the XSL Algorithm
Sort
View
158
Voted
ICA
2004
Springer
15 years 10 months ago
Independent Slow Feature Analysis and Nonlinear Blind Source Separation
We present independent slow feature analysis as a new method for nonlinear blind source separation. It circumvents the indeterminacy of nonlinear independent component analysis by ...
Tobias Blaschke, Laurenz Wiskott
CAV
2008
Springer
108views Hardware» more  CAV 2008»
15 years 7 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
15 years 11 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
139
Voted
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 10 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
JCST
2010
189views more  JCST 2010»
14 years 12 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar