Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A Parallel Genetic Algorithm for Task Mapping on Parallel Machines
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Parallel genetic algorithms for DVS scheduling of distributed embedded systems
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Automatic generation of basis test paths using variable length genetic algorithm
Information Processing Letters
| Hi-index | 0.00 |
Verbal arithmetic's is a class of constraint satisfaction problems which includes making mathematical relations between meaningful words using simple arithmetic operators like '+' in a way that the result is conceptually true, and assigning digits to the letters of these words and generating numbers in order to make correct arithmetic operations as well. In this puzzle, arithmetic operations are simple and of base ten, but are ciphered into letters. A simple way to solve such problems is by depth first search (DFS) algorithm which has a big search space even for quite small problems. DFS is an algorithm for searching a tree, tree structure. Thus going deeper and deeper until a goal node is found. The paper illustrates the design and implementation of parallel genetic algorithm that can find the solution more quickly taking less memory.