Hi Kevin,
Thanks! I will add this to my ToDo lists :)
Regards,
Ronan
Em domingo, 3 de maio de 2015 19:14:00 UTC-3, Kevin Squire escreveu:
Hi Ronan,
Looks like an interesting package!
One minor suggestion: if you ever plan to make this an actual Julia
package, it would be good to name
Hi guys!
Finally I had time to upload MGEOjulia.
You can see it here:
https://github.com/ronisbr/MGEOjulia
It is available under BSD 3-clause license.
You can see some test cases under test/mgeojulia_testcases.jl
I would appreciate any suggestion to optimize it :)
Thank you,
Ronan
Hi Ronan,
Looks like an interesting package!
One minor suggestion: if you ever plan to make this an actual Julia
package, it would be good to name it MGEO.jl. All Julia packages use this
naming convention, and it has the additional benefit of making such
packages easily searchable.
Cheers!
Thank you very much Duane! It will help me a lot.
Right now, I found something that was really slowing down my algorithm.
The original function checkDominance has the following signature:
function checkDominance(mgeoData::MGEOStructure,
candidatePoint::ParetoPoint,
On Tuesday, April 28, 2015 at 11:17:55 AM UTC-5, Ronan Chagas wrote:
Sorry, my mistake. Every problem is gone when I change
nf::Integer
to
nf::Int64
in type MGEOStructure.
I didn't know that such thing would affect the performance this much...
Sorry about that,
Ronan
No problem.
Integer is an abstract type and thus kills performance if you use it in a
type and need to access it frequently. There was discussion somewhere about
renaming abstract types like Integer and FloatingPoint to include the name
Abstract in them to avoid accidents like this. I guess this shows that
Sorry, my mistake. Every problem is gone when I change
nf::Integer
to
nf::Int64
in type MGEOStructure.
I didn't know that such thing would affect the performance this much...
Sorry about that,
Ronan
Hi Ronan,
Please ignore my last post. I misunderstood (got a little mixed up when you
were talking about bits) what the issue was, but after reading a little
more carefully I see where your challenge is. Some of the points in the
algorithm I showed you before will still be valid but in general
Hi Ronan,
Please ignore my last post. I miss understood (got a little mixed up when
you were talking about bits) what the issue was, but after reading a little
more carefully I see where your challenge is. Some of the points in the
algorithm I showed you before will still be valid but in
It's helpful if you can post the full code; gist.github.com is a good place
to drop snippets.
From what I can see here, there are two things:
(1) No idea if this is in global scope. If so, that's a problem.
(2) push!() will grow and allocate as needed. It does overallocate so you
won't get a
It will definitely help to have the code you're using for this. I've have
and, am currently doing, a lot of work in Julia on non-dominated sorting,
so I would be happy to give any help I can. I have a relatively performant
sorting algorithm I've written in Julia and getting 6000+ points down to
Actually I was able to get the go ahead from my boss to create a gist of
the code I've produced. I've modified it a little bit, as some of the
things in there are really relevant.
http://nbviewer.ipython.org/gist/dwil/5cc31d1fea141740cf96
Any comments for optimizing this a little be more would
Thanks very much guys!
I will post the entire module in github (maybe this weekend if I have time).
It will be slow, but then you can help me :)
@Mauro
The size of vars and f are fixed for each problem, thus I don't think it
can be immutable.
The dummy example is to find the Pareto frontier
Hi Duane Wilson,
Em sexta-feira, 24 de abril de 2015 11:52:08 UTC-3, Duane Wilson escreveu:
Actually I was able to get the go ahead from my boss to create a gist of
the code I've produced. I've modified it a little bit, as some of the
things in there are really relevant.
Ah I see. Yeah this probably depends a lot on the way you are representing
the bits and how you split the objectives. If each objective is an
ASCIIString of bits and they're held separately (i.e. objectives is a
Vector{ASCIIString}) what I have provided should work because the isless
function
15 matches
Mail list logo
