A Linear Algebraic Model of Algorithm-Based Fault Tolerance
IEEE Transactions on Computers
Eigenvalues and condition numbers of random matrices
SIAM Journal on Matrix Analysis and Applications
Real-Number Codes for Fault-Tolerant Matrix Operations on Processor Arrays
IEEE Transactions on Computers
Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor
IEEE Transactions on Computers
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
What is evolutionary computation?
IEEE Spectrum
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
An Overview of Evolutionary Computation
ECML '93 Proceedings of the European Conference on Machine Learning
On the State of Evolutionary Computation
Proceedings of the 5th International Conference on Genetic Algorithms
Global Convergence of Genetic Algorithms: A Markov Chain Analysis
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Condition Numbers of Gaussian Random Matrices
SIAM Journal on Matrix Analysis and Applications
Algorithm-Based Fault Tolerance for Matrix Operations
IEEE Transactions on Computers
Algorithm-Based Fault Tolerance for Fail-Stop Failures
IEEE Transactions on Parallel and Distributed Systems
Optimal real number codes for fault tolerant matrix operations
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Numerically stable real number codes based on random matrices
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Evolutionary computation: comments on the history and current state
IEEE Transactions on Evolutionary Computation
Filter bank frame expansions with erasures
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
Correcting soft errors online in LU factorization
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
| Hi-index | 0.00 |
Real number codes have been widely used in many applications. However, it is difficult to analytically find the numerically optimal codes even for three erasures. In this paper, an evolutionary computation approach is presented which can computationally construct real number codes that have near optimal numerical stability. Experimental results demonstrate that the evolutionary algorithm presented here produces real number codes close to the theoretical optimum for two erasures. The real number codes obtained from the evolutionary algorithm outperform any known existing real number codes for three erasures.