Van-Dat+Cung

a French computer scientist, and research professor at [|G-SCOP Laboratory] (Science for product design, optimization and management) at [|Grenoble Institute of Technology], working on [|combinatorial optimization] and topics of [|operations research]. Van-Dat Cung earned a Ph.D. in computer science in 1994 at University of Paris VI on parallel game tree search. He introduced the //Concurrent Alpha-Beta Pruning// (**CABP**) algorithm for [|MIMD] machines with shared memory, which is founded on the parallel exploration of the critical tree and on the horizontal decomposition of game trees as elaborated by Selim Akl et al. . || toc =Selected Publications=
 * Home * People * Van-Dat Cung**
 * [[image:Van-Dat Cung.JPG width="142" link="http://www.g-scop.grenoble-inp.fr/membres/m-van-dat-cung--190459.kjsp"]] ||~ || **M. Van Dat Cung**, (Van-Dat Cung)
 * Van-Dat Cung ||~ ||^ ||
 * Van-Dat Cung (**1991**). //Parcours parallele d'arbres Minimax//. Rapport de recherche RR-1549, [|INRIA], [|pdf]
 * Van-Dat Cung (**1993**). //Parallelizations of Game-Tree Search//. [|PARCO 1993], [|pdf] hosted by [|CiteSeerX]
 * Van-Dat Cung (**1994**). //Contribution à l'Algorithmique Non Numérique Parallèle : Exploration d'Espaces de Recherche//. Ph.D. thesis, University of Paris VI
 * Van-Dat Cung, [|Bertrand Le Cun] (**1994**). //[|An Efficient Implementation of Parallel A*]//. [|CFCP 1994]
 * Van-Dat Cung, [|Frédéric Roupin], [|Willem-Jan Van Hoeve] (**2000**). //[|A parallel Branch-and-Bound algorithm using a semidefinite programming relaxation for the maximum independent set problem]//. [|ROADEF'2000]

=External Links=
 * [|G-SCOP - M. Van Dat CUNG]
 * [|Van-Dat Cung | LinkedIn]
 * [|Van Dat Cung, laboratoire G-SCOP | Flickr]

=References= =What links here?= include page="Van-Dat Cung" component="backlinks" limit="40"
 * Up one level**