Stephen Paul Weber posted, “Hill climbing algorithms have no real termination condition. Slide says “continue until you are bored” #uwaterloo #CS486” @ 2012-017.585Z Leave a Response Name Email Website Comment Authenticate this comment using OpenID. Get replies via e-mail