Sunday 6 December 2015

Q58,P3,j15Which of the follwing statement is true for branch and bound search?

A)Underestimates of remaining distance may cause deviation from optimal path.
B)Overestimates can't cause right path to be overlooked.
C) Dynami programming principle can be used to discard  redundant partial paths.
D) All of the above.
Answer D.

No comments:

Post a Comment

Note: only a member of this blog may post a comment.