Benchmarking different libraries using the ONEMAX function
Time results are shown in Table 2. .
Parameters for running the algorithm are described in Table 2
As is shown in Table 2, when using all tweaks possible, and a
state of the art, compiled for optimization, non-threaded version
of the Perl interpreter (labeled as 5.10 there), an evolutionary
algorithm applied to the ONEMAX problem can run faster in Perl than
Viewing this image requires a subscription. If you are a subscriber, please log in.
This table is from the article titled "Algorithm::Evolutionary, a flexible Perl module for evolutionary computation"
(from Soft Computing), which is copyrighted by Springer-Verlag. For more information on the
copyright for this table, please refer to the full table caption and to the
The image is being made available for non-commercial purposes for subscribers to SpringerImages. For more information on what you are allowed to do with this image, please see our copyright policy.
To request permissions to use any copyrighted material, please visit the source document.
Report a copyright concern regarding this image.
Log in or register to save your favorite images and download them as high-quality PowerPoint or PDF files.
Log in or register to save your search criteria.
© Springer, part of Springer Science+Business Media.
Remote Address: 22.214.171.124 Server: 20