<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Properties of algorithms :: Computer science</title>
    <link>https://info.cours.lecalvar.fr/CM1_reseaux/s5/algo/session4/index.html</link>
    <description>Duration2h30 Presentation &amp; objectives You are certainly not the first developer to face your current problem. It certainly means that several solutions to solve it have already been envisioned.&#xA;How to compare them and to select the most appropriate one? This is the central question addressed in this session. You will acquire theoretical and technical skills to judge the adequacy between a problem and a possible algorithmic solutions. To do so, you will study theoretical algorithmic properties (specification, termination, deterministic/stochastic).</description>
    <generator>Hugo</generator>
    <language>en</language>
    <atom:link href="https://info.cours.lecalvar.fr/CM1_reseaux/s5/algo/session4/index.xml" rel="self" type="application/rss+xml" />
  </channel>
</rss>