I wrote a GA and would like to benchmark it against other
implementations so I can verify my code works correctly. Are there any
reliable references where the basic GA is tested on functions such as
Sphere, Rosenbrock, Rastrigin and Griewank?
Re: WAM Vs. TOAM ... insisting on using the less fluffy benchmark to make B-Prolog look bad: ... This profiling is easier to do in a WAM... the WAM implementations on this program even though, as you know, some WAM ... (comp.lang.prolog)
Re: Sizes of Integer Types ... to avoid having to write and VERIFY a hole mess of conditional code to select the correct type INCLUDING on implementations you don't currently have and INCLUDING verifying that it will correctly fail to compile on other implementations you don't have. ... I can see why auto was potentially useful and so in the language at one point. ... (comp.lang.c)
Re: Fastcode Memory Manager B&V 0.09 ... Take a look at the result of the Fragmentation Benchmark.... very badly and still barely pass your validation4 code....implementations can result in different levels of fragmentation. ... (borland.public.delphi.language.basm)
Re: Benchmarking a Genetic Algorithm ...Ayman wrote: ... against other implementations so I can verify my ...references where the basic GA is tested on ... (comp.ai.genetic)
