25,161
edits
Changes
Created page with "'''Home * People * Vincent David''' '''Vincent David''',<br/> a French computer scientist and researcher. He holds a Ph.D. in 1993 from [https://en.wikipedi..."
'''[[Main Page|Home]] * [[People]] * Vincent David'''
'''Vincent David''',<br/>
a French computer scientist and researcher. He holds a Ph.D. in 1993 from [https://en.wikipedia.org/wiki/%C3%89cole_nationale_sup%C3%A9rieure_de_l%27a%C3%A9ronautique_et_de_l%27espace École nationale supérieure de l'aéronautique et de l'espace] (National School of Aeronautics and Space), [https://en.wikipedia.org/wiki/Toulouse Toulouse] <ref>[http://copainsdavant.linternaute.com/membre/15167869/1937553667/vincent_david/ Vincent David, Ecole Nationale Supérieure De L'Aéronautique Et De L'Espace (Supaero)]</ref>, with the title ''Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint. Etude et application au Minimax = Parallel Minimax algorithm for heuristic tree searching and real-time reasoning. Study and application to the Minimax''
<ref>[[Vincent David]] ('''1993'''). ''Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint. Etude et application au Minimax''. Parallel algorithm for heuristic tree searching and real-time reasoning. Study and application of Minimax, Ph.D. thesis, [https://en.wikipedia.org/wiki/%C3%89cole_nationale_sup%C3%A9rieure_de_l%27a%C3%A9ronautique_et_de_l%27espace École nationale supérieure de l'aéronautique et de l'espace], [https://en.wikipedia.org/wiki/Toulouse Toulouse]</ref>. The thesis was part of the [https://en.wikipedia.org/wiki/Saturn Saturn] studies conducted at [https://en.wikipedia.org/wiki/Office_National_d%27%C3%89tudes_et_de_Recherches_A%C3%A9rospatiales Onera], and describes a loosely synchronized distributed [[Alpha-Beta|alpha-beta]] search algorithm coined '''αβ*''', utilizing a [[Shared Hash Table|shared transposition table]], but according to [[Jean-Christophe Weill]], who advanced '''αβ*''' to [[ABDADA]], with an ineffective controller and not considering the eldest son. Further, Vincent David introduced [https://en.wikipedia.org/wiki/Entropy_%28information_theory%29 entropic] [[Extensions|extensions]] near the horizon if the [[Chess Position|position]] was not stable enough. The idea was implemented by Jean-Christophe Weill and [[Marc-François Baudot]] in [[Joker]], but despite some impressive play, later abandoned.
=Selected Publications=
<ref>[http://orlabs.oclc.org/identities/viaf-198681136/ David, Vincent informaticien]</ref>
* [[Vincent David]] ('''1993'''). ''Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint. Etude et application au Minimax''. Parallel algorithm for heuristic tree searching and real-time reasoning. Study and application of Minimax, Ph.D. thesis, [https://en.wikipedia.org/wiki/%C3%89cole_nationale_sup%C3%A9rieure_de_l%27a%C3%A9ronautique_et_de_l%27espace École nationale supérieure de l'aéronautique et de l'espace], [https://en.wikipedia.org/wiki/Toulouse Toulouse]
This thesis presents a parallel processing model for the implementation of reasoning algorithms as part of a smart real-time system, and is part of the SATURNE study conducted at CERT-ONERA. This project is based on the assumption that processing tasks have the ability to adapt to time periods. To satisfy this model, the proposed solutions are the reduction of the search space and the acceleration of the treatments thanks to the parallelism. These changes must occur during the execution of the process, the management of parallelism becomes dynamic. Moreover, decision trees represent a fundamental method for solving many artificial intelligence problems, such as the theory of one-player games, optimization problems, two-player game theory, graphs and / or and many other NP-complete problems. Also, from the example of the minimax algorithm on real game trees, an implementation is performed on Modulor, a distributed architecture machine based on transputers developed at CERT-ONERA. The method of parallelization is based on a suppression of the control between the research processes, in favor of a speculative parallelism and the complete sharing of the information realized thanks to a physically distributed but virtually shared memory. The contribution of our approach for distributed and fault-tolerant real-time systems is evaluated thanks to the experimental results obtained.
=See also=
* [[ABDADA]]
* [[Lazy SMP]]
=External Links=
* [http://copainsdavant.linternaute.com/membre/15167869/1937553667/vincent_david/ Vincent David, Ecole Nationale Supérieure De L'Aéronautique Et De L'Espace (Supaero)]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|David]]
'''Vincent David''',<br/>
a French computer scientist and researcher. He holds a Ph.D. in 1993 from [https://en.wikipedia.org/wiki/%C3%89cole_nationale_sup%C3%A9rieure_de_l%27a%C3%A9ronautique_et_de_l%27espace École nationale supérieure de l'aéronautique et de l'espace] (National School of Aeronautics and Space), [https://en.wikipedia.org/wiki/Toulouse Toulouse] <ref>[http://copainsdavant.linternaute.com/membre/15167869/1937553667/vincent_david/ Vincent David, Ecole Nationale Supérieure De L'Aéronautique Et De L'Espace (Supaero)]</ref>, with the title ''Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint. Etude et application au Minimax = Parallel Minimax algorithm for heuristic tree searching and real-time reasoning. Study and application to the Minimax''
<ref>[[Vincent David]] ('''1993'''). ''Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint. Etude et application au Minimax''. Parallel algorithm for heuristic tree searching and real-time reasoning. Study and application of Minimax, Ph.D. thesis, [https://en.wikipedia.org/wiki/%C3%89cole_nationale_sup%C3%A9rieure_de_l%27a%C3%A9ronautique_et_de_l%27espace École nationale supérieure de l'aéronautique et de l'espace], [https://en.wikipedia.org/wiki/Toulouse Toulouse]</ref>. The thesis was part of the [https://en.wikipedia.org/wiki/Saturn Saturn] studies conducted at [https://en.wikipedia.org/wiki/Office_National_d%27%C3%89tudes_et_de_Recherches_A%C3%A9rospatiales Onera], and describes a loosely synchronized distributed [[Alpha-Beta|alpha-beta]] search algorithm coined '''αβ*''', utilizing a [[Shared Hash Table|shared transposition table]], but according to [[Jean-Christophe Weill]], who advanced '''αβ*''' to [[ABDADA]], with an ineffective controller and not considering the eldest son. Further, Vincent David introduced [https://en.wikipedia.org/wiki/Entropy_%28information_theory%29 entropic] [[Extensions|extensions]] near the horizon if the [[Chess Position|position]] was not stable enough. The idea was implemented by Jean-Christophe Weill and [[Marc-François Baudot]] in [[Joker]], but despite some impressive play, later abandoned.
=Selected Publications=
<ref>[http://orlabs.oclc.org/identities/viaf-198681136/ David, Vincent informaticien]</ref>
* [[Vincent David]] ('''1993'''). ''Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint. Etude et application au Minimax''. Parallel algorithm for heuristic tree searching and real-time reasoning. Study and application of Minimax, Ph.D. thesis, [https://en.wikipedia.org/wiki/%C3%89cole_nationale_sup%C3%A9rieure_de_l%27a%C3%A9ronautique_et_de_l%27espace École nationale supérieure de l'aéronautique et de l'espace], [https://en.wikipedia.org/wiki/Toulouse Toulouse]
This thesis presents a parallel processing model for the implementation of reasoning algorithms as part of a smart real-time system, and is part of the SATURNE study conducted at CERT-ONERA. This project is based on the assumption that processing tasks have the ability to adapt to time periods. To satisfy this model, the proposed solutions are the reduction of the search space and the acceleration of the treatments thanks to the parallelism. These changes must occur during the execution of the process, the management of parallelism becomes dynamic. Moreover, decision trees represent a fundamental method for solving many artificial intelligence problems, such as the theory of one-player games, optimization problems, two-player game theory, graphs and / or and many other NP-complete problems. Also, from the example of the minimax algorithm on real game trees, an implementation is performed on Modulor, a distributed architecture machine based on transputers developed at CERT-ONERA. The method of parallelization is based on a suppression of the control between the research processes, in favor of a speculative parallelism and the complete sharing of the information realized thanks to a physically distributed but virtually shared memory. The contribution of our approach for distributed and fault-tolerant real-time systems is evaluated thanks to the experimental results obtained.
=See also=
* [[ABDADA]]
* [[Lazy SMP]]
=External Links=
* [http://copainsdavant.linternaute.com/membre/15167869/1937553667/vincent_david/ Vincent David, Ecole Nationale Supérieure De L'Aéronautique Et De L'Espace (Supaero)]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|David]]
