Discussion
When does local search perform badly on a constraint problem?
Answer: D
A tightly constrained problem with few solutions has a landscape full of assignments that violate one constraint and cannot be repaired without violating another, and the search stalls. Systematic methods with propagation do better there. Size, constraint arity and domain size affect the cost rather than the character of the difficulty. Matching the method to the instance's solution density, rather than to its size, is the judgement local search requires.
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