SOFT COMPUTING APPROACH FOR HANDLING UNCERTAIN NP-PROBLEMS
Assem Ahmed Alsawy Mahmoud Abdel Hak;
Abstract
NP problems remain open questions whether or not an efficient general
solution method exists. Finding near optimal solution, i.e. satisfied solution,
is the most important goal in applying any of naturally inspired heuristic
techniques to solve NP prob
solution method exists. Finding near optimal solution, i.e. satisfied solution,
is the most important goal in applying any of naturally inspired heuristic
techniques to solve NP prob
Other data
| Title | SOFT COMPUTING APPROACH FOR HANDLING UNCERTAIN NP-PROBLEMS | Other Titles | أساليب الحسابات الناعمة لتناول المشكلات الغير مؤكدة ذات درجة تعقيد غير كثيرة الحدود | Authors | Assem Ahmed Alsawy Mahmoud Abdel Hak | Keywords | SOFT COMPUTING APPROACH FOR HANDLING UNCERTAIN NP-PROBLEMS | Issue Date | 2009 | Description | NP problems remain open questions whether or not an efficient general solution method exists. Finding near optimal solution, i.e. satisfied solution, is the most important goal in applying any of naturally inspired heuristic techniques to solve NP prob |
Attached Files
| File | Size | Format | |
|---|---|---|---|
| 94636r2482.pdf | 618.72 kB | Adobe PDF | View/Open |
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.