The solution of NP hard/ NP Complete problems is one of the most contentious issues in Computer Science. The NP problems are of two types namely decision problems and optimization problems. The NP Hard optimization problems have traditionally been dealt with via techniques like Dynamic algorithms, which are computationally inefficient. The need of the hour is to solve the problems in requisite time and at the same time appropriately deal with the PSpace issues. The special issue intends to explore the use of techniques like Cellular Automata and Diploid Genetic Algorithms in the above. The papers presenting the use of Genetic Algorithms, Neural networks, Fuzzy Logic etc., to solve such problems, are also encouraged provided that they present credible data and experimental results.
The special issue intends to be a pioneer in the use of the above techniques. The issue would serve two purposes. First is the applicability of a technique in solution of a particular problem and the second would be the handling of theoretical issues in the yet unexplored Soft Computing techniques. The issue also welcomes the papers pertaining to the PSapce and time complexity issues in the above problems.
The issue welcomes research papers, reviews and reports pertaing to the above topics.
Import Dates & Submit
Important dates
Submission Deadline: January 08, 2015
Notification of Acceptance: February 18, 2015
Final Version Due: February 26, 2015
Special Issue Publishing Date: March, 2015
Submit your article now
Manuscripts should be submitted as an attached file to an e-mail directed to the Chief Guest Editor, Harsh Bhasin at the address: <I_harsh_bhasin@yahoo.com>