Using simulated annealing to solve np-complete problems
Other Title(s)
التقطيع الصوري باستعمال الإحماء
Joint Authors
al-Husayni, Abd al-Rahman Hamid
al-Madyani, Muhammad Abd Allah
Majid, Sad Kazim
Source
Issue
Vol. 2005, Issue 8 (31 Dec. 2005), pp.28-54, 27 p.
Publisher
Publication Date
2005-12-31
Country of Publication
Iraq
No. of Pages
27
Main Subjects
Information Technology and Computer Science
Abstract EN
Simulated annealing algorithm is a recent powerful technique for solvinghard problems.
furthe rmore, if has a very interesting features: generalapplicability.
in fact, it has been used successfully for solving many np-complete problems.
this paper describes elementary theoretical concepts and principles of.
this technique and presents.
as well, some examples with results in witch simulated annealing algorithm is used to solve hard problems
American Psychological Association (APA)
al-Husayni, Abd al-Rahman Hamid& al-Madyani, Muhammad Abd Allah& Majid, Sad Kazim. 2005. Using simulated annealing to solve np-complete problems. al-Mansour،Vol. 2005, no. 8, pp.28-54.
https://search.emarefa.net/detail/BIM-968829
Modern Language Association (MLA)
al-Husayni, Abd al-Rahman Hamid…[et al.]. Using simulated annealing to solve np-complete problems. al-Mansour No. 8 (2005), pp.28-54.
https://search.emarefa.net/detail/BIM-968829
American Medical Association (AMA)
al-Husayni, Abd al-Rahman Hamid& al-Madyani, Muhammad Abd Allah& Majid, Sad Kazim. Using simulated annealing to solve np-complete problems. al-Mansour. 2005. Vol. 2005, no. 8, pp.28-54.
https://search.emarefa.net/detail/BIM-968829
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 53-54
Record ID
BIM-968829
