Difference between revisions of "Dana S. Nau"

From Chessprogramming wiki
Jump to: navigation, search
Line 51: Line 51:
 
* [https://en.wikipedia.org/wiki/Dana_S._Nau Dana S. Nau from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Dana_S._Nau Dana S. Nau from Wikipedia]
 
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=75703 The Mathematics Genealogy Project - Dana S. Nau]
 
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=75703 The Mathematics Genealogy Project - Dana S. Nau]
* Dana S. Nau at [[Judea Pearl#Symposium|Judea Pearl Symposium]], 2010, [https://en.wikipedia.org/wiki/YouTube YouTube] Video » [[KriegSpiel]], [[Opponent Model Search]]  
+
* <span id="JudeaPearl"></span>Dana S. Nau at [[Judea Pearl#Symposium|Judea Pearl Symposium]], 2010, [https://en.wikipedia.org/wiki/YouTube YouTube] Video » [[KriegSpiel]], [[Opponent Model Search]]  
 
: {{#evu:https://www.youtube.com/watch?v=Epph5qKQwoA|alignment=left|valignment=top}}
 
: {{#evu:https://www.youtube.com/watch?v=Epph5qKQwoA|alignment=left|valignment=top}}
  

Revision as of 18:11, 19 February 2019

Home * People * Dana S. Nau

Dana S. Nau [1]

Dana S. Nau,
an American computer scientist and professor at the University of Maryland, College Park. His research interests include artificial intelligence in game theory and planning, in particular HTN planning. Dana Nau discovered and elaborated on pathology on certain game trees, where a deeper search does not improve the decision quality, but makes the decision more and more random. Along with Stephen J.J. Smith and Thomas A. Throop, Dana Nau developed AI planning techniques in the Bridge program Bridge Baron [2] .

Selected Publications

[3] [4] [5]

1979

  • Dana S. Nau (1979). Quality of Decision Versus Depth of Search on Game Trees. Ph.D. thesis, Duke University, advisor Alan Biermann
  • Dana S. Nau (1979). Preliminary results regarding quality of play versus depth of search in game playing. First Internat. Symposium on Policy Analysis and Information Systems

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level