Parallelizing a nondeterministic optimization algorithm

Parallelizing a nondeterministic optimization algorithm

This research explores the idea that for certain optimization problems there is a way to parallelize the algorithm such that the parallel efficiency can exceed one hundred percent. Specifically, a parallel compiler, PC, is used to apply shortcutting techniquest to a metaheuristic Ant Colony Optimiza...

Full description

Bibliographic Details
Main Author: D'Souza, Sammy Raymond
Format: Others
Published: CSUSB ScholarWorks 2007
Subjects:
Combinatorial optimization
Electronic data processing Distributed processing
Evolutionary computation
Evolutionary computation.
Theory and Algorithms
Online Access:https://scholarworks.lib.csusb.edu/etd-project/3084
https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=4120&context=etd-project

Internet

https://scholarworks.lib.csusb.edu/etd-project/3084
https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=4120&context=etd-project

Similar Items