Discussion
What is a local maximum in local search?
Answer: D
A local maximum traps hill climbing, since every move looks worse and the algorithm stops with a suboptimal answer. Random restarts, sideways moves and simulated annealing are the standard escapes. A flat region of equal neighbours is a plateau, and the best state overall is the global maximum. Naming each failure mode separately matters because each has its own remedy, and applying the wrong one wastes effort.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development