Difference between revisions of "Rainer Feldmann"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 4: Line 4:
  
 
'''Rainer Feldmann''',<br/>
 
'''Rainer Feldmann''',<br/>
a German computer scientist, games researcher and former chess programmer. He was member of the research group of [[Burkhard Monien]] at the [[Paderborn University]]. Along with [[Peter Mysliwietz]], Rainer Feldmann co-authored of the massive [[Parallel Search|parallel]] chess program [[Zugzwang (Program)|Zugzwang]] applying the [[Young Brothers Wait Concept]], and the single processor program [[Alpha I]] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=119 Rainer Feldmann's ICGA Tournaments]</ref> . Rainer and Peter were also [[:Category:Tournament Director|tournament organizers]] as well as participants and three times winner of the earlier International Paderborn Computer Chess Championships [[IPCCC]].
+
a German computer scientist, games researcher and former chess programmer. He was member of the research group of [[Burkhard Monien]] at the [[Paderborn University]]. Along with [[Peter Mysliwietz]], Rainer Feldmann co-authored of the massive [[Parallel Search|parallel]] chess program [[Zugzwang (Program)|Zugzwang]] applying the [[Young Brothers Wait Concept]], and the single processor program [[Alpha I]] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=119 Rainer Feldmann's ICGA Tournaments]</ref> . Rainer and Peter were also [[:Category:Tournament Director|tournament organizers]] as well as participants and three times winner of the earlier International Paderborn Computer Chess Championships [[IPCCC]]. Rainer Feldmann holds a Ph.D. on ''Game Tree Search on Massively Parallel Systems'' <ref>Feldmann, R. ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Ph.D. thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]</ref> and introduced [[Fail-High Reductions]], as implemented in Zugzwang <ref>Feldmann, R. ('''1997'''). ''Fail-High Reductions.'' [[Advances in Computer Chess 8]], [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=4399933A9FAE32A9C855DED714120C66?doi=10.1.1.51.4897&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.4897 CiteSeerX]</ref> .  
 
 
Rainer Feldmann holds a Ph.D. on ''Game Tree Search on Massively Parallel Systems'' <ref>Feldmann, R. ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Ph.D. thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]</ref> and introduced [[Fail-High Reductions]], as implemented in Zugzwang <ref>Feldmann, R. ('''1997'''). ''Fail-High Reductions.'' [[Advances in Computer Chess 8]], [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=4399933A9FAE32A9C855DED714120C66?doi=10.1.1.51.4897&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.4897 CiteSeerX]</ref> .  
 
  
 
=Photos=  
 
=Photos=  
Line 34: Line 32:
 
* [[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Ph.D. thesis, [http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]
 
* [[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Ph.D. thesis, [http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]
 
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1994'''). ''Game-Tree Search on a Massively Parallel System''. [[Advances in Computer Chess 7]]
 
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1994'''). ''Game-Tree Search on a Massively Parallel System''. [[Advances in Computer Chess 7]]
 +
==1995 ...==
 
* [[Ulf Lorenz]], [[Valentin Rottmann]], [[Rainer Feldmann]], [[Peter Mysliwietz]] ('''1995'''). ''Controlled Conspiracy-Number Search''. [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]
 
* [[Ulf Lorenz]], [[Valentin Rottmann]], [[Rainer Feldmann]], [[Peter Mysliwietz]] ('''1995'''). ''Controlled Conspiracy-Number Search''. [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]
 
* [[Rainer Feldmann]] ('''1995'''). ''The 13th World Microcomputer-Chess Championship. Results and Selected Games''. [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
 
* [[Rainer Feldmann]] ('''1995'''). ''The 13th World Microcomputer-Chess Championship. Results and Selected Games''. [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
Line 43: Line 42:
 
* [[Burkhard Monien]], [[Rainer Feldmann]] (Eds.) ('''2002'''). ''[https://link.springer.com/book/10.1007%2F3-540-45706-2 Euro-Par 2002 Parallel Processing]''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS], Vol. 2400, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
 
* [[Burkhard Monien]], [[Rainer Feldmann]] (Eds.) ('''2002'''). ''[https://link.springer.com/book/10.1007%2F3-540-45706-2 Euro-Par 2002 Parallel Processing]''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS], Vol. 2400, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
 
: [[Rainer Feldmann]], [https://dblp.uni-trier.de/pers/hd/r/Roucairol:Catherine Catherine Roucairol] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/3-540-45706-2_129 Discrete Optimization]''.
 
: [[Rainer Feldmann]], [https://dblp.uni-trier.de/pers/hd/r/Roucairol:Catherine Catherine Roucairol] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/3-540-45706-2_129 Discrete Optimization]''.
 +
==2005 ...==
 
* [[Rainer Feldmann]] ('''2005'''). ''Selfish Routing of Splittable Flow with Respect to Maximum Congestion''. [https://dblp.uni-trier.de/db/conf/dagstuhl/P5011.html Computing and Markets 2005], [https://pdfs.semanticscholar.org/95cd/275b0bda148e91625bca3882441d684af4f7.pdf pdf]
 
* [[Rainer Feldmann]] ('''2005'''). ''Selfish Routing of Splittable Flow with Respect to Maximum Congestion''. [https://dblp.uni-trier.de/db/conf/dagstuhl/P5011.html Computing and Markets 2005], [https://pdfs.semanticscholar.org/95cd/275b0bda148e91625bca3882441d684af4f7.pdf pdf]
 
* [[Rainer Feldmann]], [https://scholar.google.com/citations?user=PAACT74AAAAJ&hl=en Marios Mavronicolas], [[Burkhard Monien]] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-10841-9_26 Nash Equilibria for Voronoi Games on Transitive Graphs]''. [https://dblp.uni-trier.de/db/conf/wine/wine2009.html WINE 2009], [https://pdfs.semanticscholar.org/bd97/15d439e49db3ee3cfa452892a511fb12f1bb.pdf pdf]
 
* [[Rainer Feldmann]], [https://scholar.google.com/citations?user=PAACT74AAAAJ&hl=en Marios Mavronicolas], [[Burkhard Monien]] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-10841-9_26 Nash Equilibria for Voronoi Games on Transitive Graphs]''. [https://dblp.uni-trier.de/db/conf/wine/wine2009.html WINE 2009], [https://pdfs.semanticscholar.org/bd97/15d439e49db3ee3cfa452892a511fb12f1bb.pdf pdf]

Latest revision as of 18:28, 8 December 2019

Home * People * Rainer Feldmann

Rainer Feldmann [1]

Rainer Feldmann,
a German computer scientist, games researcher and former chess programmer. He was member of the research group of Burkhard Monien at the Paderborn University. Along with Peter Mysliwietz, Rainer Feldmann co-authored of the massive parallel chess program Zugzwang applying the Young Brothers Wait Concept, and the single processor program Alpha I [2] . Rainer and Peter were also tournament organizers as well as participants and three times winner of the earlier International Paderborn Computer Chess Championships IPCCC. Rainer Feldmann holds a Ph.D. on Game Tree Search on Massively Parallel Systems [3] and introduced Fail-High Reductions, as implemented in Zugzwang [4] .

Photos

Chrillyvincerainer.jpg

Chrilly, Vincent, Ulf (back) and Rainer, IPCCC 1998 [5]

See also

Selected Publications

[6]

1986 ...

1990 ...

1995 ...

2000 ...

Rainer Feldmann, Catherine Roucairol (2002). Discrete Optimization.

2005 ...

External Links

References

  1. Rainer Feldmann - Universität Paderborn
  2. Rainer Feldmann's ICGA Tournaments
  3. Feldmann, R. (1993). Game Tree Search on Massively Parallel Systems. Ph.D. thesis, pdf
  4. Feldmann, R. (1997). Fail-High Reductions. Advances in Computer Chess 8, pdf from CiteSeerX
  5. Ein Besuch in Paderborn 1998 by Thorsten Czub
  6. dblp: Rainer Feldmann
  7. Jonathan Schaeffer (1989). Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 12, No. 4
  8. Jonathan Schaeffer (1990). A Rejoinder to the Response to a Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 13, No. 1
  9. Forschungszentrum Jülich schickt Cray T-3 zur Schachweltmeisterschaft, June 09, 1999, Computerwoche (German) » WCCC 1999

Up one level