<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel>
        <link xmlns="http://www.w3.org/2005/Atom" rel="hub" href="https://overblog.superfeedr.com"/>
        <link xmlns="http://www.w3.org/2005/Atom" rel="self" href="https://teytaud.over-blog.com/rss" type="application/rss+xml"/>
        <title><![CDATA[Quelques millimètres de carapace]]></title>
        <link>https://teytaud.over-blog.com/</link>
        <generator>Overblog - https://www.over-blog.com</generator>
        <description><![CDATA[Objectifs: diffusion scientifique, essentiellement en fran&ccedil;ais, et litt&eacute;rature.]]></description>
                    <item>
    <title><![CDATA[Reader-friendly introductions to AI topics for dummies like me :-)]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/2016/05/reader-friendly-introductions-to-ai-topics-for-dummies-like-me.html]]></link>
    <guid>https://teytaud.over-blog.com/2016/05/reader-friendly-introductions-to-ai-topics-for-dummies-like-me.html</guid>
    <pubDate>Mon, 30 May 2016 09:44:54 +0200</pubDate>
    <description><![CDATA[Reader-friendly introductions to AI topics, for dummies (like me :-) ) olivier.teytaud@gmail.com A lot of “reader’s digest” versions of tutorial or famous articles :-) (usually no original research, just an overview of existing works; I’ll try to satisfy... ]]></description>
        <dc:creator><![CDATA[akalatic]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Fast Graphical User Interface on Linux]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-fast-graphical-user-interface-on-linux-107721313.html]]></link>
    <guid>https://teytaud.over-blog.com/article-fast-graphical-user-interface-on-linux-107721313.html</guid>
    <pubDate>Tue, 03 Jul 2012 12:11:00 +0200</pubDate>
    <description><![CDATA[Zenity is just a great program for doing quickly a Graphical User Interface on Linux. I am sure you can understand the following program, which asks if you want to increase or decrease, and runs "./increase" or "./decrease" accordingly: ===========================================... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Monte-Carlo Tree Search in one page]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-monte-carlo-tree-search-in-one-page-107144004.html]]></link>
    <guid>https://teytaud.over-blog.com/article-monte-carlo-tree-search-in-one-page-107144004.html</guid>
    <pubDate>Tue, 19 Jun 2012 10:11:00 +0200</pubDate>
    <description><![CDATA[MCTS algorithm Input: a state S Output: a decision D Global variable: a tree T, each node having nbSims initiliazed at a single node with state S and nbSims=0 and totalReward=0 While (I have time) { Do one simulation from state S until a game is over... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[A small selected sample of politeness rules viewed in a Taiwanese school]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-a-small-selected-sample-of-taiwanese-politeness-rules-100698963.html]]></link>
    <guid>https://teytaud.over-blog.com/article-a-small-selected-sample-of-taiwanese-politeness-rules-100698963.html</guid>
    <pubDate>Sun, 04 Mar 2012 00:26:00 +0100</pubDate>
    <description><![CDATA[I am French and spend one year in Tainan, a city in the south of Taiwan. I had been told, prior to coming, that Tainan was particularly friendly, even compared to Taiwan which is a particularly friendly country. I have spent 7 months here, and there are... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[A Linux program for evaluating your level in Go]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-a-linux-program-for-evaluating-your-level-in-go-91946330.html]]></link>
    <guid>https://teytaud.over-blog.com/article-a-linux-program-for-evaluating-your-level-in-go-91946330.html</guid>
    <pubDate>Sat, 10 Dec 2011 08:21:00 +0100</pubDate>
    <description><![CDATA[Hi; you want to evaluate quickly your level in Go and you have a machine under Linux ? Here a tool for doing this: 1) Download http://www.lri.fr/~teytaud/yourLevel.tgz ; for example with your favorite tool; if you like lynx, you might: lynx -dump -source... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Les fourmis en une page]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-les-fou-85520933.html]]></link>
    <guid>https://teytaud.over-blog.com/article-les-fou-85520933.html</guid>
    <pubDate>Fri, 30 Sep 2011 17:36:00 +0200</pubDate>
    <description><![CDATA[Un bref survol de wikipedia sur ces bestioles, à l'occasion d'un séjour à Taiwan, où chaque nourriture qui traine donne lieu à une invasion de mini-fourmis. 1) Colonies & Nids Les fourmis ont des nids de 20m environ, constitués de nombreuses galeries... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Des éducatifs gratuits et biens pour votre ordinateur]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-educatifs-gratuits-et-biens-sous-linux-82780675.html]]></link>
    <guid>https://teytaud.over-blog.com/article-educatifs-gratuits-et-biens-sous-linux-82780675.html</guid>
    <pubDate>Mon, 29 Aug 2011 06:10:00 +0200</pubDate>
    <description><![CDATA[Vous voulez des jeux éducatifs bons et gratuits ? Des solutions existent; je les rassemble ici en tâchant d'avoir le lien direct vers la page utile: Vous utilisez Windows, vous voulez un logiciel éducatif bien fait à télécharger pour jeunes enfants (<10... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Multiprecision with Octave - a dirty patch using Aribas]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-multiprecision-with-octave-a-dirty-patch-using-aribas-82303917.html]]></link>
    <guid>https://teytaud.over-blog.com/article-multiprecision-with-octave-a-dirty-patch-using-aribas-82303917.html</guid>
    <pubDate>Wed, 24 Aug 2011 04:36:00 +0200</pubDate>
    <description><![CDATA[Preliminaries: Octave is a just great free software, very good alternative to the expensive Matlab. It does not handle multiprecision (to keep it simple, let's say that multiprecision is computation with very high precision). Aribas is a GNU free tool... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[MoGo &amp; MoGoTW: des algorithmes qui jouent au Go et au-delà]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-mogo-mogotw-programs-which-play-go-and-beyond-77022592.html]]></link>
    <guid>https://teytaud.over-blog.com/article-mogo-mogotw-programs-which-play-go-and-beyond-77022592.html</guid>
    <pubDate>Fri, 17 Jun 2011 21:45:00 +0200</pubDate>
    <description><![CDATA[I. Introduction Le Go, vieux jeu asiatique, résiste toujours aux machines.Il fait partie de ces jeux où la méthodologie usuelle, à base d'algorithme alpha-beta et de fonction d'évaluation approchée, ne donne rien de bon. Forte combinatoire, pas de fonction... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[A GTP program for Rengo]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-a-gtp-program-for-rengo-77022041.html]]></link>
    <guid>https://teytaud.over-blog.com/article-a-gtp-program-for-rengo-77022041.html</guid>
    <pubDate>Fri, 17 Jun 2011 21:40:00 +0200</pubDate>
    <description><![CDATA[What is rengo ? Rengo consists in having two players playing Go as a team, without communicating - each player plays in turn. What is this page about ? You have two programs which play Go in GTP and you want to use them as a Rengo pair - this page is... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[How to backup your blog (linux users)]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-how-to-backup-your-blog-linux-users-73660712.html]]></link>
    <guid>https://teytaud.over-blog.com/article-how-to-backup-your-blog-linux-users-73660712.html</guid>
    <pubDate>Thu, 12 May 2011 06:04:00 +0200</pubDate>
    <description><![CDATA[For some reason, you want to back up you blog: Possible reason 1:you want a copy that will still work if some images (links) disappear (images which are included from the web are not duplicated - if they disappear from the web your image disappears).... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[How to play blind Go or one-color-Go on a computer ?]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-how-to-play-blind-computer-go-73399340.html]]></link>
    <guid>https://teytaud.over-blog.com/article-how-to-play-blind-computer-go-73399340.html</guid>
    <pubDate>Sun, 08 May 2011 15:13:00 +0200</pubDate>
    <description><![CDATA[Blind-Go is to the game of Go what Blind-Chess is to chess: playing just orally, without any board (or possibly with an empty board as a visual support). OneColor-Go consists in playing with just one color for stones - you have to remember which stones... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Game of Go: the first H7 win of a computer against a top professional player]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-game-of-go-the-first-h7-win-of-a-computer-against-a-professional-player-73152153.html]]></link>
    <guid>https://teytaud.over-blog.com/article-game-of-go-the-first-h7-win-of-a-computer-against-a-professional-player-73152153.html</guid>
    <pubDate>Wed, 04 May 2011 16:02:00 +0200</pubDate>
    <description><![CDATA[MoGoTW, a program based on recent progresses in artificial intelligence (not using alpha-beta but Monte-Carlo Tree Search, see here for other applications of this beautiful techniques), won the first game with handicap 7 against a top professional player.... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Blind Go, Random Go, 13x13 Go, Rengo.]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-blind-go-random-go-13x13-go-rengo-73149193.html]]></link>
    <guid>https://teytaud.over-blog.com/article-blind-go-random-go-13x13-go-rengo-73149193.html</guid>
    <pubDate>Wed, 04 May 2011 15:18:00 +0200</pubDate>
    <description><![CDATA[SMP clusters form NUTN (left) and Grid5000 (right) Ping-Chiang Chou (5 Dan pro Go player) Below the summary of games between computers and humans in SSCI 2011; SGFs are here: http://ssci2011.nutn.edu.tw/result.htm and Go from random initial board report... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Le pôle nord magnétique bouge.]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-le-pole-nord-magnetique-bouge-70249501.html]]></link>
    <guid>https://teytaud.over-blog.com/article-le-pole-nord-magnetique-bouge-70249501.html</guid>
    <pubDate>Sat, 26 Mar 2011 10:25:00 +0100</pubDate>
    <description><![CDATA[Fréquence des changements de nord magnétique et prochaine migration du nord magnétique. Le champ magnétique terrestre change parfois fréquemment, et est parfois très stable pendant très longtemps. Là, on a à peu près le même champ magnétique depuis 780... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Bibliographie &quot;optimisation&quot;]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-bibliographie-optimisation-54968765.html]]></link>
    <guid>https://teytaud.over-blog.com/article-bibliographie-optimisation-54968765.html</guid>
    <pubDate>Thu, 05 Aug 2010 13:39:00 +0200</pubDate>
    <description><![CDATA[Vous partez de zéro et vous voulez devenir un expert en optimisation ? Il y a du travail :-) Ci-dessous une bibliographie (juste deux livres) sur le sujet, pour avoir les bases: Précis de Recherche Opérationnelle, Faure, Lemaire et Picouleau. En un seul... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Bibliographie &quot;machine learning / apprentissage&quot;]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-bibliographie-machine-learning-apprentissage-54968078.html]]></link>
    <guid>https://teytaud.over-blog.com/article-bibliographie-machine-learning-apprentissage-54968078.html</guid>
    <pubDate>Thu, 05 Aug 2010 13:22:00 +0200</pubDate>
    <description><![CDATA[Une bibliographie de theorie de l'apprentissage et réseaux de neurones et un peu d'apprentissage par renforcement. Ci-dessous donc la liste de mes bouquins favoris sur le sujet: A theory of learning and generalization, M. Vidyasagar, 1997. Tres bon livre,... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Computers vs Humans in Barcelona (WCCI 2010)]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-mogo-vs-humans-in-barcelona-wcci-2010-morning-54191608.html]]></link>
    <guid>https://teytaud.over-blog.com/article-mogo-vs-humans-in-barcelona-wcci-2010-morning-54191608.html</guid>
    <pubDate>Tue, 20 Jul 2010 13:49:00 +0200</pubDate>
    <description><![CDATA[The 20th of July, 2010, at WCCI 2010 in Barcelona, some games were played by boths against humans. This page is centered on the games played by MoGo and MoGoTW, but I give also a fast overview of other game. A main novelty is the presence of 13x13 games.... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Le dérèglement du monde, par Amin Maalouf]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-le-dereglement-du-monde-par-amin-maalouf-54073167.html]]></link>
    <guid>https://teytaud.over-blog.com/article-le-dereglement-du-monde-par-amin-maalouf-54073167.html</guid>
    <pubDate>Sat, 17 Jul 2010 22:18:00 +0200</pubDate>
    <description><![CDATA[Très bon livre. Un livre qui survole ce qui ne va pas dans la psychologie, la philosophie, la politique humaine ces derniers temps; facile à lire car allant à l'essentiel sans verbosité inutile; bien documenté, sur des sujets peu évoqués ici et sans crainte... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[&quot;rsync&quot; - transférer des gros fichiers dans un monde où ça coupe]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-rsync-transferer-des-gros-fichiers-dans-un-monde-ou-a-coupe-52929923.html]]></link>
    <guid>https://teytaud.over-blog.com/article-rsync-transferer-des-gros-fichiers-dans-un-monde-ou-a-coupe-52929923.html</guid>
    <pubDate>Fri, 25 Jun 2010 10:55:00 +0200</pubDate>
    <description><![CDATA[Transférer des gros fichiers c'est fatigant, parce que souvent ça plante avant la fin. Comment faire ? Ouf, Linux et Unix ont pensé à tout: en plus des classiques "ftp" et "scp", rappelés ci-dessous, il y a le fabuleux rsync que vous devez absolument... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[ssh-keygen: clefs publiques, clefs privées pour les nuls]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-ssh-keygen-clefs-publiques-clefs-privees-pour-les-nuls-52929089.html]]></link>
    <guid>https://teytaud.over-blog.com/article-ssh-keygen-clefs-publiques-clefs-privees-pour-les-nuls-52929089.html</guid>
    <pubDate>Fri, 25 Jun 2010 10:40:00 +0200</pubDate>
    <description><![CDATA[Régulièrement, qqn se perd dans les outils de clefs publiques/clefs privées; ces lignes sont là pour expliquer la base de "ssh_keygen". A quoi ca sert ? a se logguer de maniere un peu sure sur une machine distante Y depuis une machine X sans aucun login/password... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Valgrind: segfaults, fuites mémoires et lenteurs]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-valgrind-segfaults-fuites-memoires-et-lenteurs-52928394.html]]></link>
    <guid>https://teytaud.over-blog.com/article-valgrind-segfaults-fuites-memoires-et-lenteurs-52928394.html</guid>
    <pubDate>Fri, 25 Jun 2010 10:27:00 +0200</pubDate>
    <description><![CDATA[Vous ne connaissez pas valgrind ? Ca doit être dur le débugguage. Allez, prenez le temps d'apprendre valgrind, c'est vraiment pas long pour démarrer! 1) Installer valgrind, c'est facile: - sous ubuntu/debian: sudo apt-get install valgrind - sous mandriva:... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[CVS --- gestion de versions concurrentes quelques infos pour demarrer (juste pour demarrer)]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-cvs-gestion-de-versions-concurrentes-quelques-infos-pour-demarrer-juste-pour-demarrer-52927919.html]]></link>
    <guid>https://teytaud.over-blog.com/article-cvs-gestion-de-versions-concurrentes-quelques-infos-pour-demarrer-juste-pour-demarrer-52927919.html</guid>
    <pubDate>Fri, 25 Jun 2010 10:18:00 +0200</pubDate>
    <description><![CDATA[Si vous êtes développeur et ignorez la gestion concurrente de versions, vous ne pourrez plus vous en passez! Remarques: - CVS est souvent remplacé par SVN. Ca fonctionne presque pareil. - Git est un peu différent, par absence d'une référence centralisée.... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[On the complexity of games]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-on-the-complexity-of-games-51881321.html]]></link>
    <guid>https://teytaud.over-blog.com/article-on-the-complexity-of-games-51881321.html</guid>
    <pubDate>Tue, 08 Jun 2010 15:07:00 +0200</pubDate>
    <description><![CDATA[How complex is your game ? A usual tool for answering such a question is computational complexity. It consists in finding where the problem is, in the following scale: The classes on the right are more difficult. For the most important classes: - PL is... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
                    <item>
    <title><![CDATA[Game of Go: ladders can be very hard]]></title>
    <link><![CDATA[https://teytaud.over-blog.com/article-game-of-go-ladders-can-be-very-hard-51708414.html]]></link>
    <guid>https://teytaud.over-blog.com/article-game-of-go-ladders-can-be-very-hard-51708414.html</guid>
    <pubDate>Sat, 05 Jun 2010 15:47:00 +0200</pubDate>
    <description><![CDATA[This page is only understandable by go players. I'm interested in the game of Go as it's a good testbed for computer science - whereas in chess computers are stronger than humans (by far), computers are still weak in the game of Go. In particular, they... ]]></description>
        <dc:creator><![CDATA[teytaud]]></dc:creator>
    </item>
            </channel>
</rss>

