Vincent David

Home * People * Vincent David

Vincent David,
a French computer scientist and researcher. He holds 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 , 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 . 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

• 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, École nationale supérieure de l'aéronautique et de l'espace, 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

• Vincent David, Ecole Nationale Supérieure De L'Aéronautique Et De L'Espace (Supaero)

References

Up one level