Linear Genetic Programming: Intron removal algorithm
- Let set R_eff always contain all registers that are effective at the current program position. R_eff := { r | r is output register }. Start at the last program instruction and move backwards.
- Mark the next preceding operation in program with: destination register r_dest element-of R_eff. If such an instruction is not found then go to 5.
- .If the operation directly follows a branch or a sequence of branches then mark these instructions too. Otherwise remove r_dest
from R_eff . - Insert each source (operand) register r_op of newly marked
instructions in R_eff if not already contained. Go to 2. - Stop. All unmarked instructions are introns.
This is the algorithm given , I know the question was asked before, but I'm not clear on a few things( and turns out there isn't much online material assisting with this stuff). I mainly need to know what we're comparing. You have a program, and within the program, are instructions with the form of :
r0= r1 + r2
Just as an example. So I understand we start at the last instruction and move backwards for our comparisons. But in step 2 when it says to move backwards are we going back the to the immediately previous instructions, or are we moving backwards to the instruction with a register in common?
For the example I gave, would I keep searching backwards till I found another r0, or would I go backwards until I found a r1 or r2?
I'm pretty confused with this simple thing and would appreciate any help I can get
genetic-programming
asked Nov 16 '18 at 18:43
Robin WhiteRobin White
11
add a comment |
- Let set R_eff always contain all registers that are effective at the current program position. R_eff := { r | r is output register }. Start at the last program instruction and move backwards.
- Mark the next preceding operation in program with: destination register r_dest element-of R_eff. If such an instruction is not found then go to 5.
- .If the operation directly follows a branch or a sequence of branches then mark these instructions too. Otherwise remove r_dest
from R_eff . - Insert each source (operand) register r_op of newly marked
instructions in R_eff if not already contained. Go to 2. - Stop. All unmarked instructions are introns.
This is the algorithm given , I know the question was asked before, but I'm not clear on a few things( and turns out there isn't much online material assisting with this stuff). I mainly need to know what we're comparing. You have a program, and within the program, are instructions with the form of :
r0= r1 + r2
Just as an example. So I understand we start at the last instruction and move backwards for our comparisons. But in step 2 when it says to move backwards are we going back the to the immediately previous instructions, or are we moving backwards to the instruction with a register in common?
For the example I gave, would I keep searching backwards till I found another r0, or would I go backwards until I found a r1 or r2?
I'm pretty confused with this simple thing and would appreciate any help I can get
genetic-programming
asked Nov 16 '18 at 18:43
Robin WhiteRobin White
11
Introns are considered useful for evolutionary algorithms performance, there are papers on this. Forgive me my laziness, but I'll only suggest googling something like "role of introns in evolutionary programming".
– werediver
Dec 30 '18 at 11:31
add a comment |
- Let set R_eff always contain all registers that are effective at the current program position. R_eff := { r | r is output register }. Start at the last program instruction and move backwards.
- Mark the next preceding operation in program with: destination register r_dest element-of R_eff. If such an instruction is not found then go to 5.
- .If the operation directly follows a branch or a sequence of branches then mark these instructions too. Otherwise remove r_dest
from R_eff . - Insert each source (operand) register r_op of newly marked
instructions in R_eff if not already contained. Go to 2. - Stop. All unmarked instructions are introns.
This is the algorithm given , I know the question was asked before, but I'm not clear on a few things( and turns out there isn't much online material assisting with this stuff). I mainly need to know what we're comparing. You have a program, and within the program, are instructions with the form of :
r0= r1 + r2
Just as an example. So I understand we start at the last instruction and move backwards for our comparisons. But in step 2 when it says to move backwards are we going back the to the immediately previous instructions, or are we moving backwards to the instruction with a register in common?
For the example I gave, would I keep searching backwards till I found another r0, or would I go backwards until I found a r1 or r2?
I'm pretty confused with this simple thing and would appreciate any help I can get
genetic-programming
asked Nov 16 '18 at 18:43
Robin WhiteRobin White
11
- Let set R_eff always contain all registers that are effective at the current program position. R_eff := { r | r is output register }. Start at the last program instruction and move backwards.
- Mark the next preceding operation in program with: destination register r_dest element-of R_eff. If such an instruction is not found then go to 5.
- .If the operation directly follows a branch or a sequence of branches then mark these instructions too. Otherwise remove r_dest
from R_eff . - Insert each source (operand) register r_op of newly marked
instructions in R_eff if not already contained. Go to 2. - Stop. All unmarked instructions are introns.
This is the algorithm given , I know the question was asked before, but I'm not clear on a few things( and turns out there isn't much online material assisting with this stuff). I mainly need to know what we're comparing. You have a program, and within the program, are instructions with the form of :
r0= r1 + r2
Just as an example. So I understand we start at the last instruction and move backwards for our comparisons. But in step 2 when it says to move backwards are we going back the to the immediately previous instructions, or are we moving backwards to the instruction with a register in common?
For the example I gave, would I keep searching backwards till I found another r0, or would I go backwards until I found a r1 or r2?
I'm pretty confused with this simple thing and would appreciate any help I can get
genetic-programming
genetic-programming
asked Nov 16 '18 at 18:43
Robin WhiteRobin White
11
asked Nov 16 '18 at 18:43
Robin WhiteRobin White
11
asked Nov 16 '18 at 18:43
Robin WhiteRobin White
11
asked Nov 16 '18 at 18:43
Robin WhiteRobin White
11
asked Nov 16 '18 at 18:43
Robin WhiteRobin White
11
11
Introns are considered useful for evolutionary algorithms performance, there are papers on this. Forgive me my laziness, but I'll only suggest googling something like "role of introns in evolutionary programming".
– werediver
Dec 30 '18 at 11:31
add a comment |
Introns are considered useful for evolutionary algorithms performance, there are papers on this. Forgive me my laziness, but I'll only suggest googling something like "role of introns in evolutionary programming".
– werediver
Dec 30 '18 at 11:31
Introns are considered useful for evolutionary algorithms performance, there are papers on this. Forgive me my laziness, but I'll only suggest googling something like "role of introns in evolutionary programming".
– werediver
Dec 30 '18 at 11:31
Introns are considered useful for evolutionary algorithms performance, there are papers on this. Forgive me my laziness, but I'll only suggest googling something like "role of introns in evolutionary programming".
– werediver
Dec 30 '18 at 11:31
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53343667%2flinear-genetic-programming-intron-removal-algorithm%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53343667%2flinear-genetic-programming-intron-removal-algorithm%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Introns are considered useful for evolutionary algorithms performance, there are papers on this. Forgive me my laziness, but I'll only suggest googling something like "role of introns in evolutionary programming".
– werediver
Dec 30 '18 at 11:31