Difference between revisions of "Andreas Junghanns"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 4: | Line 4: | ||
'''Andreas Junghanns''',<br/> | '''Andreas Junghanns''',<br/> | ||
| − | a German computer scientist. Junghanns studied at the [[Chemnitz University of Technology|Technical University of Chemnitz]], Germany, in Madrid, Spain, and at the [[University of Alberta]], Canada from 1994 until 1999, where he defended his Ph.D. thesis ''Pushing the Limits: New Developments in Single-Agent Search'' [[#PushingtheLimits|Jung 1999]] in 1999. His research interests include [[Search|search algorithms]] like [https://en.wikipedia.org/wiki/Intelligent_agent single-agent] search applied to the game of [[Sokoban]]. Along with [[Yngvi Björnsson]], Junghanns co-authored the chess program [[The Turk]], which was test-bed of their [[Uncertainty Cut-Offs]]. After some years of corporate IT research, Andreas Junghanns co-founded the ''QTronic GmbH'' 2006 in Berlin, Germany <ref>[http://www.qtronic.de/en/andreas_junghanns.html Andreas Junghanns, Ph.D.] founder [https://www.qtronic.de/en/company.html QTronic GmbH] 2006</ref>. | + | a German computer scientist. Junghanns studied at the [[Chemnitz University of Technology|Technical University of Chemnitz]], Germany, in Madrid, Spain, and at the [[University of Alberta]], Canada from 1994 until 1999, where he defended his Ph.D. thesis ''Pushing the Limits: New Developments in Single-Agent Search'' ([[#PushingtheLimits|Jung 1999]]) in 1999. His research interests include [[Search|search algorithms]] like [https://en.wikipedia.org/wiki/Intelligent_agent single-agent] search applied to the game of [[Sokoban]]. Along with [[Yngvi Björnsson]], Junghanns co-authored the chess program [[The Turk]], which was test-bed of their [[Uncertainty Cut-Offs]]. After some years of corporate IT research, Andreas Junghanns co-founded the ''QTronic GmbH'' 2006 in Berlin, Germany <ref>[http://www.qtronic.de/en/andreas_junghanns.html Andreas Junghanns, Ph.D.] founder [https://www.qtronic.de/en/company.html QTronic GmbH] 2006</ref>. |
=Selected Publications= | =Selected Publications= | ||
Revision as of 16:04, 21 November 2018
Home * People * Andreas Junghanns
Andreas Junghanns [1]
Andreas Junghanns,
a German computer scientist. Junghanns studied at the Technical University of Chemnitz, Germany, in Madrid, Spain, and at the University of Alberta, Canada from 1994 until 1999, where he defended his Ph.D. thesis Pushing the Limits: New Developments in Single-Agent Search (Jung 1999) in 1999. His research interests include search algorithms like single-agent search applied to the game of Sokoban. Along with Yngvi Björnsson, Junghanns co-authored the chess program The Turk, which was test-bed of their Uncertainty Cut-Offs. After some years of corporate IT research, Andreas Junghanns co-founded the QTronic GmbH 2006 in Berlin, Germany [2].
Selected Publications
1994 ...
- Andreas Junghanns (1994). Methoden zur Verbesserung von Suchalgorithmen. Diplomarbeit, Technische Universität Chemnitz-Zwickau.
- Andreas Junghanns (1994). Fuzzy Numbers as a Tool in Chess Programs. ICCA Journal, Vol. 17, No. 3
- Andreas Junghanns, Christian Posthoff, Michael Schlosser (1995). Search with Fuzzy Numbers. In: Proc. of the FUZZ-IEEE/IFES'95, Yokohama/Japan, 20.-24. März 1995, Vol. II
- Yngvi Björnsson, Mark Brockington, Andreas Junghanns, Aske Plaat (1996). Report on the Advances in Computer Chess 8 Conference. ICCA Journal, Vol. 19, No. 3 » Advances in Computer Chess 8
- Yngvi Björnsson, Tony Marsland, Jonathan Schaeffer, Andreas Junghanns (1997). Searching with Uncertainty Cut-offs. ICCA Journal, Vol. 20, No. 1, pdf preprint
- Yngvi Björnsson, Tony Marsland, Jonathan Schaeffer, Andreas Junghanns (1997). Searching with Uncertainty Cut-offs. Advances in Computer Chess 8
- Andreas Junghanns, Jonathan Schaeffer (1997). Search versus knowledge in game-playing programs revisited. IJCAI-97, Vol. 1, pdf
- Andreas Junghanns, Jonathan Schaeffer, Mark Brockington, Yngvi Björnsson, Tony Marsland (1997). Diminishing Returns for Additional Search in Chess. Advances in Computer Chess 8, ps
- Andreas Junghanns (1998). Are there Practical Alternatives to Alpha-Beta? ICCA Journal, Vol. 21, No. 1
- Andreas Junghanns, Jonathan Schaeffer (1998). Relevance Cuts: Localizing the Search.. CG 1998, pdf from CiteSeerX
- Andreas Junghanns (1999). Pushing the Limits: New Developments in Single-Agent Search, Ph.D. Thesis, Department of Computing Science, University of Alberta. [5]
2000 ...
- Andreas Junghanns, Jonathan Schaeffer (2000). Sokoban: A Challenging Single-Agent Search Problem. Games in AI Research (eds. Jaap van den Herik and Hiroyuki Iida), pp. 139-157. Published by the Universiteit Maastricht in cooperation with the University of Shizuoka. ISBN 90-621-6416-1. ps, pdf from CiteSeerX
- Jonathan Schaeffer, Aske Plaat, Andreas Junghanns (2001). Unifying Single-agent and Two-player search. Information Sciences, Vol. 135, pp. 151-175. ISSN 0020-0255. ps
- Andreas Junghanns, Jonathan Schaeffer (2001). Sokoban: Improving the Search with Relevance Cuts. Theoretical Computer Science, vol. 252, no. 1-2, pp. 151-175, pdf
- Carlos Linares López, Andreas Junghanns (2002). Perimeter Search Performance. CG 2002
