{"version":"1.0","type":"link","title":"Anytime algorithm - Newikis","description":"In computer science, an anytime algorithm is an algorithm that can return a valid solution to a problem even if it is interrupted before it ends. The algorithm is expected to find better and better solutions the longer it keeps running.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}