Dynamic Inertia Weight Particle Swarm Optimization for Solving Nonogram Puzzles
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 10
Abstract
Particle swarm optimization (PSO) has shown to be a robust and efficient optimization algorithm therefore PSO has received increased attention in many research fields. This paper demonstrates the feasibility of applying the Dynamic Inertia Weight Particle Swarm Optimization to solve a Non-Polynomial (NP) Complete puzzle. This paper presents a new approach to solve the Nonograms Puzzle using Dynamic Inertia Weight Particle Swarm Optimization (DIW-PSO). We propose the DIW-PSO to optimize a problem of finding a solution for Nonograms Puzzle. The experimental results demonstrate the suitability of DIW-PSO approach for solving Nonograms puzzles. The outcome results show that the proposed DIW-PSO approach is a good promising DIW-PSO for NP-Complete puzzles.
Authors and Affiliations
Habes Alkhraisat, Hasan Rashaideh
Keywords
Related Articles
- EP ID EP96428
- DOI 10.14569/IJACSA.2016.071037
- Views 101
- Downloads 0
Evaluation of Data Security Measures in a Network Environment Towards Developing Cooperate Data Security Guidelines
Data security in a networked environment is a topic that has become significant in organizations. As companies and organizations rely more on technology to run their businesses, connecting system to each other in...
A Multi-Label Classification Approach Based on Correlations Among Labels
Multi label classification is concerned with learning from a set of instances that are associated with a set of labels, that is, an instance could be associated with multiple labels at the same time. This task occurs fre...
A Comprehensive IoT Attacks Survey based on a Building-blocked Reference Model
Internet of Things (IoT) has not yet reached a distinctive definition. A generic understanding of IoT is that it offers numerous services in many domains, utilizing conventional internet infrastructure by enabling differ...
Optimal Compression of Medical Images
In today’s healthcare system, medical images are playing a vital role in the diagnosis. The challenges arise to the hospital management systems (HMS) are to store and communicate the large volume of medical images genera...
FRoTeMa: Fast and Robust Template Matching
Template matching is one of the most basic techniques in computer vision, where the algorithm should search for a template image T in an image to analyze I. This paper considers the rotation, scale, brightness and contra...