Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Efficient Generation of Minimal Length Addition Chains
SIAM Journal on Computing
Efficient Parallel Modular Exponentiation Algorithm
ADVIS '02 Proceedings of the Second International Conference on Advances in Information Systems
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
Efficient pre-processing for large window-based modular exponentiation using genetic algorithms
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Strength Two Covering Arrays Construction Using a SAT Representation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Heuristics for minimum brauer chain problem
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Finding optimal addition chains using a genetic algorithm approach
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
| Hi-index | 0.00 |
This paper aims to face the problem of getting Brauer Chains (BC) of minimum length by using a Mutation-Selection (MS) algorithm and a representation based on the Factorial Number System (FNS). We explain our MS strategy and report the experimental results for a benchmark considered difficult to show that this approach is a viable alternative to solve this problem by getting the shortest BCs reported in the literature and in a reasonable time. Also, it was used a fine-tuning process for the MS algorithm, which was done with the help of Covering Arrays (CA) and the solutions of a Diophantine Equation (DE).