A mutation-selection algorithm for the problem of minimum brauer chains
ADVANCES IN SOFT COMPUTING, PT II(2011)
摘要
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).
更多查看译文
关键词
ms algorithm,reasonable time,minimum brauer chain,fine-tuning process,factorial number system,mutation-selection algorithm,diophantine equation,ms strategy,minimum length,brauer chains,covering arrays
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要