<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Catch multiple pieces of cheese... more efficiently :: Computer science</title>
    <link>https://info.cours.lecalvar.fr/sae-s6/s5/project/session5/index.html</link>
    <description>Duration2h30 + preparation Presentation &amp; objectives In the previous session, you found out that catching all pieces of cheese in a minimum number of actions is a very hard problem to solve. An alternate approach is to use heuristics, i.e., approximate algorithms that will return a solution that is not optimal in general, but sufficiently close to optimal to be acceptable, and that can be computed in a low time.</description>
    <generator>Hugo</generator>
    <language>en</language>
    <atom:link href="https://info.cours.lecalvar.fr/sae-s6/s5/project/session5/index.xml" rel="self" type="application/rss+xml" />
  </channel>
</rss>