April 2013


Options: Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Mehran Maghoumi <[log in to unmask]>
Reply To:
ECJ Evolutionary Computation Toolkit <[log in to unmask]>
Mon, 8 Apr 2013 17:16:52 -0400
text/plain (17 lines)
OK so the subject may be a bit misleading but that is the best I could come up with.
I am trying to evaluate my individuals on CUDA. Based on some papers, I concluded that the best way to 
do so is by converting the individuals to Reverse Polish Notation (Postfix) expressions.
I know the best way to do this is to write classes that generate postfix individuals in the first place.
However, since the main focus of my work is not ultra-optimization, any conversion of the tree to postfix 
expression will do.
Right now what I am doing is using a modified version of the "makeLispTree" method in GPNode class to 
generate a posfix expression from the tree.
As it is stated in that function's JavaDoc, this is not a good method for doing over and over again or 
sending the individuals over the network.
What method can I use to do the same thing but with better performance?

Since ECJ has IslandModel parallelism, how is it transferring individuals with acceptable performance from 
an island to the next?

Thanks for any response in advance.