Comparative Study of Recursive and OpenMp Genetic Algorithm in Solving Towers of Hanoi

IJARCCE
doi 10.17148/ijarcce.2015.4209
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tejass Publisheers

Related search

The Application of Hanoi Towers Game in Logistics Management

Advances in Logistics, Operations, and Management Science
2016English

Comparative Study of the Parallelization of the Smith-Waterman Algorithm on OpenMP and Cuda C

Journal of Computer and Communications
2015English

Optimisation in a Natural System: Argentine Ants Solve the Towers of Hanoi

Journal of Experimental Biology
EvolutionEcologyInsect ScienceMolecular BiologySystematicsAnimal ScienceMedicineAquatic ScienceBehaviorZoologyPhysiology
2010English

Analysis of the Performance of Genetic Algorithm Parallelized With OpenMP Through Execution Traces

Revista de Informatica Teorica e Aplicada
Computer Science
2019English

Comparative Study of Genetic and Discrete Firefly Algorithm for Combinatorial Optimization

2018English

Dual Population Genetic Algorithm (GA) Versus OpenMP GA for Multimodal Function Optimization

International Journal of Computer Applications
2013English

Comparative Study of Performance of Chemical Reaction Optimization With Genetic Algorithm (GA)

International Journal of Computer Applications
2014English

Solving the SAT Problem Using Genetic Algorithm

Advances in Science, Technology and Engineering Systems
EngineeringAstronomyPhysicsManagement of TechnologyInnovation
2017English

Correction To: Towers of Hanoi Problems: Deriving Iterative Solutions by Program Transformations

BIT Numerical Mathematics
Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy