Improving Multi Expression Programming Using Reuse-Based Evaluation
نویسندگان
چکیده
Multi expression programming is a linear genetic programming that dynamically determines its output from a series of genes of the chromosome. It works on a fixed-length individual, but gives rise to the complexity of the decoding process and fitness computations. To solve this problem, we proposed an improved algorithm that can speed up individual assessments through reuse analysis of evaluations. The experimental result shows that the present approach performs quite well on the considered problems.
منابع مشابه
Optimum Maintenance Strategy Selection using a Hybrid Approach based on Analytical Hierarchy Process and Revised Multi Choice Goal Programming
This study aims to select optimal maintenance strategy for components of an electric motor of the National Iranian Oil Refining and Distribution Company. In this regard, a method based on revised multi choice goal programming and analytic hierarchy process (AHP) is presented. Since improving the equipment reliability is an important issue, reliability centered maintenance (RCM) strategies are i...
متن کاملEmpirical Comparison of Incremental Learning Strategies for Genetic Programming-Based Keep-Away Soccer Agents
We consider the problem of incremental transfer of behaviors in a multi-agent learning test bed (keep-away soccer) consisting of homogeneous agents (keepers). One method for this incremental transfer is called the easy missions approach, and seeks to synthesize solutions for complex tasks from those for simpler ones. In genetic programming (GP), this has been achieved by identifying goals and f...
متن کاملForward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation
Program slicing has been mainly studied in the context of imperative languages, where it has been applied to many software engineering tasks, like program understanding, maintenance, debugging, testing, code reuse, etc. This paper introduces the first forward slicing technique for multi-paradigm declarative programs. In particular, we show how program slicing can be defined in terms of online p...
متن کاملTrial-Based Dynamic Programming for Multi-Agent Planning
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they encounter during the trials, leading to significant computational savings. We present a novel trial-based dynamic programming (TBDP) algorithm for DEC-POMDPs that extends these benefits to multi-agent settings. The algor...
متن کاملDwarf Frankenstein is still in your memory: tiny code reuse attacks
Code reuse attacks such as return oriented programming and jump oriented programming are the most popular exploitation methods among attackers. A large number of practical and non-practical defenses are proposed that differ in their overhead, the source code requirement, detection rate and implementation dependencies. However, a usual aspect among these methods is consideration of the common be...
متن کامل