Home * People * Vincent David

Vincent David,
a French computer scientist with a Ph.D. in 1993 from École nationale supérieure de l'aéronautique et de l'espace (National School of Aeronautics and Space), Toulouse, France [1], 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 [2]. The thesis was part of the Saturn studies conducted at Onera, and describes a loosely synchronized distributed alpha-beta search algorithm coined αβ*, utilizing a 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 entropic extensions near the horizon if the 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

[3]

Abstract

Google translation of Vincent David's thesis Résumé [4]:
  • This thesis presents a model of parallel processing for the implementation of algorithms for reasoning in the context of a real-time intelligent, and is part of the Saturn study conducted at ONERA-CERT. This project is based on the assumption that the processing tasks have the ability to adapt to temporal deadlines. To meet this model, the proposed solutions are reducing the search space and speeding up processing through parallelism. These changes have to intervene during the execution of the process, the degree of parallelism becomes dynamic. Moreover, decision trees represent a fundamental method to solve many problems of artificial intelligence, such as game theory, optimization problems, the theory of two-player games, and/or graphs, and many otherNP-complete problems. Also, from the example of the Minimax algorithm on real game trees, an implementation is performed on modular, machine distributed architecture based on transputers developed at ONERA-CERT. The method of parallelization is based on an abolition of checks between the search process in favor of speculative parallelism and full sharing of information made possible by a physically distributed memory but virtually shared. The contribution of our approach for real-time systems and fault-tolerant distributed is evaluated through experimental results.

See also


External Links


References

  1. ^ Vincent David, Ecole Nationale Supérieure De L'Aéronautique Et De L'Espace (Supaero)
  2. ^ 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 to the Minimax, Ph.D. Thesis, École nationale supérieure de l'aéronautique et de l'espace, Toulouse, France
  3. ^ David, Vincent informaticien
  4. ^ 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 to the Minimax

What links here?


Up one level