Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Van-Dat Cung
Edit
0
3
…
2
Tags
people
researcher
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Van-Dat Cung
M. Van Dat Cung
, (Van-Dat Cung)
a French
[1]
computer scientist, and research professor at
G-SCOP Laboratory
(Science for product design, optimization and management) at
Grenoble Institute of Technology
[2]
, 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
[3]
and on the horizontal decomposition of game trees as elaborated by
Selim Akl
et al.
[4]
.
Van-Dat Cung
[5]
Table of Contents
Selected Publications
External Links
References
What links here?
Selected Publications
[6]
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
^
Vietnamese people in France
^
G-SCOP - M. Van Dat CUNG
^
Donald Knuth
,
Ronald W. Moore
(
1975
).
An Analysis of Alpha-Beta Pruning
.
Artificial Intelligence
, Vol. 6, No. 4, pp 293–326. Reprinted in
Donald Knuth
(
2000
).
Selected Papers on Analysis of Algorithms
.
CSLI lecture notes series
102, ISBN 1-57586-212-3,
pdf
^
Selim Akl
,
David T. Barnard
,
R.J. Doran
(
1980
).
Simulation and Analysis in Deriving Time and Storage Requirements for a Parallel Alpha-Beta Pruning Algorithm
. IEEE International Conference on Parallel Processing, pp. 231-234.
^
G-SCOP - M. Van Dat CUNG
^
dblp: Van-Dat Cung
What links here?
Page
Date Edited
Alpha-Beta
Jan 28, 2018
Parallel Search
Dec 30, 2017
People
Feb 28, 2018
University of Paris
Nov 26, 2015
Van-Dat Cung
Nov 28, 2015
Up one level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
a French [1] computer scientist, and research professor at G-SCOP Laboratory (Science for product design, optimization and management) at Grenoble Institute of Technology [2], 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 [3] and on the horizontal decomposition of game trees as elaborated by Selim Akl et al. [4].
Table of Contents
Selected Publications
[6]External Links
References
What links here?
Up one level