@inproceedings{10.1109/CEC.2013.6557951,
    abstract = "Many evolutionary algorithms efficient to solve a wide range of problems have been proposed and validated in the literature. We call the problem addressed in this paper 'the problem of refining the design'. Given an evolutionary algorithm that includes many operators, we would like to assess if all of the latter are really relevant to accomplish the former's performance. In this paper, we present a framework to evaluate an evolutionary algorithm that has already been designed. The goal of this evaluation is to study the choices that we have to simplify the code in respect to its results accuracy. The results show that an efficient tuner can assist us in this task by obtaining information that help design decisions. © 2013 IEEE.",
    year = "2013",
    title = "Trading accuracy for simplicity in evolutionary algorithms",
    pages = "3125-3131",
    doi = "10.1109/CEC.2013.6557951",
    journal = "2013 IEEE Congress on Evolutionary Computation, CEC 2013"
}

{"_id":"7CyaiXAW7pt5B5sSm","bibbaseid":"anonymous-tradingaccuracyforsimplicityinevolutionaryalgorithms-2013","downloads":0,"creationDate":"2017-03-31T20:15:33.002Z","title":"Trading accuracy for simplicity in evolutionary algorithms","author_short":null,"year":2013,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Many evolutionary algorithms efficient to solve a wide range of problems have been proposed and validated in the literature. We call the problem addressed in this paper 'the problem of refining the design'. Given an evolutionary algorithm that includes many operators, we would like to assess if all of the latter are really relevant to accomplish the former's performance. In this paper, we present a framework to evaluate an evolutionary algorithm that has already been designed. The goal of this evaluation is to study the choices that we have to simplify the code in respect to its results accuracy. The results show that an efficient tuner can assist us in this task by obtaining information that help design decisions. © 2013 IEEE.","year":"2013","title":"Trading accuracy for simplicity in evolutionary algorithms","pages":"3125-3131","doi":"10.1109/CEC.2013.6557951","journal":"2013 IEEE Congress on Evolutionary Computation, CEC 2013","bibtex":"@inproceedings{10.1109/CEC.2013.6557951,\n abstract = \"Many evolutionary algorithms efficient to solve a wide range of problems have been proposed and validated in the literature. We call the problem addressed in this paper 'the problem of refining the design'. Given an evolutionary algorithm that includes many operators, we would like to assess if all of the latter are really relevant to accomplish the former's performance. In this paper, we present a framework to evaluate an evolutionary algorithm that has already been designed. The goal of this evaluation is to study the choices that we have to simplify the code in respect to its results accuracy. The results show that an efficient tuner can assist us in this task by obtaining information that help design decisions. © 2013 IEEE.\",\n year = \"2013\",\n title = \"Trading accuracy for simplicity in evolutionary algorithms\",\n pages = \"3125-3131\",\n doi = \"10.1109/CEC.2013.6557951\",\n journal = \"2013 IEEE Congress on Evolutionary Computation, CEC 2013\"\n}\n\n","key":"10.1109/CEC.2013.6557951","id":"10.1109/CEC.2013.6557951","bibbaseid":"anonymous-tradingaccuracyforsimplicityinevolutionaryalgorithms-2013","urls":{},"downloads":0,"html":""},"search_terms":["trading","accuracy","simplicity","evolutionary","algorithms"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}