Türkçe | English
GRADUATE INSTITUTE of NATURAL and APPLIED SCIENCES / DEPARTMENT of COMPUTER ENGINEERING
Computer Engineering, Masters with Thesis
Course Catalog
http://ceng.ktu.edu.tr
Phone: +90 0462 3773157
FBE
GRADUATE INSTITUTE of NATURAL and APPLIED SCIENCES / DEPARTMENT of COMPUTER ENGINEERING / Computer Engineering, Masters with Thesis
Katalog Ana Sayfa
  Katalog Ana Sayfa  KTÜ Ana Sayfa   Katalog Ana Sayfa
 
 
BIL5070Heuristic Methods in Problem Solving3+0+0ECTS:7.5
Year / SemesterSpring Semester
Level of CourseSecond Cycle
Status Elective
DepartmentDEPARTMENT of COMPUTER ENGINEERING
Prerequisites and co-requisitesNone
Mode of DeliveryFace to face
Contact Hours14 weeks - 3 hours of lectures per week
Lecturer--
Co-LecturerNone
Language of instructionTurkish
Professional practise ( internship ) None
 
The aim of the course:
The aim of the course is to introduce into the problem solving methods and researches in artificial intelligence field.
 
Programme OutcomesCTPOTOA
Upon successful completion of the course, the students will be able to :
PO - 1 : understand problem solving process, and define and formulate of the problems.1,2,141,3
PO - 2 : solve complex problems and analyze NP problems. 111,3
PO - 3 : build heuristic functions on pattern recognition problems.2,4,141,3
PO - 4 : analyze problems with various techniques and develop projects.1,11,12,14,151,3,5
CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), PO : Learning Outcome

 
Contents of the Course
NP-problems, Problem Solving, Heuristics, Evalution Functions, Search for a Pattern. Choose effective Notation. Squeeze principle. Modify the Problem. Exploit Symmetry. Divide into Cases. Pursue Parity. Consider Extreme Case. Soft - compyuting
 
Course Syllabus
 WeekSubjectRelated Notes / Files
 Week 1Introduction to Heuristic algorithms.
 Week 2Deterministic and non-deterministic problems. NP, P, NPN calssification
 Week 3Problem Solving, Heuristics, Evalution Functions
 Week 4Choose effective Notation. Mathematical concepts.
 Week 5Squeeze principle. Heuristics in Games
 Week 6Modify the Problem. Examples
 Week 7Exploit Symmetry. State evalution. Complexity.
 Week 8Divide into Cases.Examples
 Week 9ExamplesMid-term exam
 Week 10Pursue Parity. Polya theory
 Week 11Consider Extreme Case.
 Week 12Nielsen's heuristics
 Week 13Project
 Week 14Soft - computing
 Week 15Soft - computing examples
 Week 16End-of-term exam
 
Textbook / Material
1Özel Ders notları
 
Recommended Reading
1Polya, G. 1998, How to Solve It: A New Aspect of Mathematical Method (Princeton Science Library)
2Zbigniew Michalewicz and David B. Fogel, 2004, How to Solve It: Modern Heuristics
3Judea Pearl , 1984, Heuristics: Intelligent Search Strategies for Computer Problem Solving , The Addison-Wesley series in artificial intelligence.
 
Method of Assessment
Type of assessmentWeek NoDate

Duration (hours)Weight (%)
Mid-term exam 8 21/10/2011 2 30
Project 12 28/11/2011 2 20
End-of-term exam 16 14/01/2012 2 50
 
Student Work Load and its Distribution
Type of workDuration (hours pw)

No of weeks / Number of activity

Hours in total per term
Proje 7 2 14
Total work load14