25,161
edits
Changes
Created page with "'''Home * People * Hermann Kaindl''' FILE:Kaindl_Hermann.jpg|border|right|thumb|link=https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl| Hermann Kaindl <..."
'''[[Main Page|Home]] * [[People]] * Hermann Kaindl'''
[[FILE:Kaindl_Hermann.jpg|border|right|thumb|link=https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl| Hermann Kaindl <ref>[https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl Univ.Prof. Dipl.-Ing. Dr. Hermann Kaindl]</ref> ]]
'''Hermann Kaindl''',<br/>
an Austrian computer scientist, games researcher and since 2003 full professor at the [[Vienna University of Technology]], where he already defended his Ph.D. under supervision of [[Wilhelm Barth]] <ref>[[Hermann Kaindl]] ('''1981'''). ''Realisierung von langfristigem Planen und Massnahmen gegen den Horizont-Effekt im Computer-Schach''. Doctoral Dissertation. [[Vienna University of Technology]]</ref> <ref>[[Werner Schimanovich|Werner DePauli-Schimanovich]] ('''2006'''). ''Europolis 6''. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, Universitätsverlag Rudolf Trauner, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German), [http://books.google.com/books?id=Gf4WibmHVbcC&pg=PA175&lpg=PA175&source=bl&ots=YPtaHAp3Z4&sig=DNRPh11heo8Q1zS3UOBe0qoCF-8&hl=en&ei=0GmnTMX1GMfJswaL-NivDA&sa=X&oi=book_result&ct=result&resnum=1&ved=0CBgQ6AEwAA#v=onepage&q&f=false Google Books]</ref>. Kaindl was senior consultant with the division of program and systems engineering at [https://en.wikipedia.org/wiki/Siemens Siemens AG] [https://en.wikipedia.org/wiki/Austria Austria] <ref>[https://www.ict.tuwien.ac.at/ict/portal/media-type/html/user/ictverwalt/page/default.psml?js_language=en Univ.Prof. Dipl.-Ing. Dr.techn. Hermann Kaindl]</ref>. Concurrently to his work in the industry, Kaindl has given lectures in computer science at the Technical University of Vienna since 1984, where he received the [https://en.wikipedia.org/wiki/Habilitation venia docendi] in applied computer science ([http://de.wikipedia.org/wiki/Praktische_Informatik Praktische Informatik]) in 1989 <ref>[http://www.cs.ucl.ac.uk/research/renoir/members/siemens.html Siemens AG Österreich]</ref>.
=Merlin=
As student, Hermann Kaindl was primary author of the chess program [[Merlin]], along with [[Helmut Horacek]], [[Marcus Wagner]] and [[Roland Schreier]], competing at various [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]] and two [[World Computer Chess Championship|World Computer Chess Championships]] in the 80s <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=353 Merlin's ICGA Tournaments]</ref>.
=Photos=
[[FILE:ACC5.jpg|none|border|text-bottom|660px]]
[[Advances in Computer Chess 5]] Smalltalk:<br/>[[Hans Berliner]], [[Hermann Kaindl]], [[Helmut Horacek]], [[Adriaan de Groot]] and [[Reiner Seidel]] <ref>Photo by [[László Lindner]], [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]], pp. 117</ref>
=See also=
* [[Merlin]]
* [[Vienna University of Technology]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref><ref>[http://www.ke.informatik.tu-darmstadt.de/~juffi/publications/publications-sel.html Johannes Fürnkranz - Research Areas (Selected Publications)]</ref><ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Kaindl:Hermann.html DBLP: Hermann Kaindl]</ref>
==1978==
* [[Hermann Kaindl]], [[Werner Schimanovich]] ('''1978'''). ''Catrin - Mathematical 2-person-game''. University of Vienna
==1980 ...==
* [[Hermann Kaindl]] ('''1981'''). ''Realisierung von langfristigem Planen und Massnahmen gegen den Horizont-Effekt im Computer-Schach''. Doctoral Dissertation. [[Vienna University of Technology]]
* [[Hermann Kaindl]] ('''1982'''). ''Dynamic Control of the Quiescence Search in Computer Chess''. Cybernetics and Systems Research (ed. R. Trappl), pp. 973-977. North-Holland, Amsterdam. » [[Quiescence Search]]
* [[Hermann Kaindl]] ('''1982'''). ''Positional Long-Range Planning in Computer Chess.'' [[Advances in Computer Chess 3]], also published as [[Hermann Kaindl]] ('''1983'''). ''Positional Long-Range Planning in Computer Chess.'' [[Vienna University of Technology]], Austria.
* [[Hermann Kaindl]] ('''1982'''). ''Quiescence Search in Computer Chess.'' SIGART Newsletter, 80, pp. 124-131. Reprinted (1983) in Computer-Game-Playing: Theory and Practice, pp. 39-52. Ellis Horwood Ltd., Chichester. » [[Quiescence Search]]
* [[Hermann Kaindl]] ('''1983'''). ''Searching to Variable Depth in Computer Chess.'' Proceedings of [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai83.html IJCAI 83], pp. 760-762. Karlsruhe. [http://ijcai.org/Past%20Proceedings/IJCAI-83-VOL-2/PDF/039.pdf pdf]
* [[Hermann Kaindl]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=645759.666297 What Happened with AI's Drosophila]''? [http://www.informatik.uni-trier.de/~ley/db/conf/ogai/ogai1985.html ÖGAI 1985]: 194-203
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Marcus Wagner]] ('''1986'''). ''Selective Search versus Brute Force.'' [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Hermann Kaindl]] ('''1988'''). ''Minimaxing Theory and Practice''. AI Magazine, Vol. 9, No. 3, pp. 69-76. [http://www.aaai.org/ojs/index.php/aimagazine/article/viewFile/944/862 pdf]
* [[Hermann Kaindl]] ('''1988'''). ''Useful Statistics from Tournament Programs''. [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1988'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees: The Details.'' Tech. Report #50, Department of Statistics and Computer Science, [[Vienna University of Technology]], Austria.
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1989'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
* [[Hermann Kaindl]] ('''1989'''). ''Towards a Theory of Knowledge''. [[Advances in Computer Chess 5]]
* [[Hermann Kaindl]], [http://www.arnetminer.org/viewperson.do?naid=276308&name=Anton%20Scheucher Anton Scheucher] ('''1989'''). ''The Reason for the Benefits of Minmax Search''. Proc. of the 11 th IJCAI, pp. 322–327, Detroit, MI.
==1990 ...==
* [[Hermann Kaindl]] ('''1990'''). ''Tree Searching Algorithms''. [[Computers, Chess, and Cognition]], pp. 133-158
* [[Hermann Kaindl]], [[Reza Shams]], [[Helmut Horacek]] ('''1991'''). ''[http://portal.acm.org/citation.cfm?id=123034 Minimax Search Algorithms with and without Aspiration Windows].'' [[IEEE#TPAMI|IEEE Transactions on Pattern Analysis and Machine Intelligence]], Vol. 13, No. 12
* [[Reza Shams]], [[Hermann Kaindl]], [[Helmut Horacek]] ('''1991'''). ''Using Aspiration Windows for Minimax Algorithms''. [[Conferences#IJCAI1991|IJCAI 1991]], [http://ijcai.org/Proceedings/91-1/Papers/031.pdf pdf]
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''Feature Construction during Tree Learning''. [http://www.informatik.uni-trier.de/~ley/db/conf/ki/gwai91.html#KaindlB91 GWAI 1991]: 50-61.
* [[Hermann Kaindl]], [http://www.arnetminer.org/viewperson.do?naid=276308&name=Anton%20Scheucher Anton Scheucher] ('''1992'''). ''Reasons for the Effect of Bounded Look-Ahead Search''. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 22, No. 5, pp. 992-1007.
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1995'''). ''Feature Construction during Tree Learning''. [http://www.informatik.uni-trier.de/~ley/db/conf/gosler/gosler1995.html#MehlsamKB95 GOSLER Final Report] 1995: 391-403
* [[Hermann Kaindl]], Gerhard Kainz, Angelika Leeb, Harald Smetana ('''1995'''). ''How to use limited memory in heuristic search''. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence ([http://137.226.34.227/dblp/db/conf/ijcai/ijcai95.html IJCAI-95]), Montreal, Canada, pp. 236-242. [http://dli.iiit.ac.in/ijcai/IJCAI-95-VOL%201/pdf/031.pdf pdf]
==2000 ...==
* [[Johannes Fürnkranz]], [[Bernhard Pfahringer]], [[Hermann Kaindl]], [[Stefan Kramer]] ('''2000'''). ''[https://scholar.google.com/citations?view_op=view_citation&hl=en&user=0QXx46sAAAAJ&cstart=20&pagesize=80&citation_for_view=0QXx46sAAAAJ:k_IJM867U9cC Learning to Use Operational Advice]''. ECAI-00, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/ecai-00.pdf pdf]
* [[Hermann Kaindl]], [[Stefan Kramer]] ('''2006'''). ''[http://wwwkramer.in.tum.de/research/pubs/kai06kra Are Automated Traceability Checks Needed?]'' ISOneWorld 2006
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=377 Hermann Kaindl's ICGA Tournaments]
* [https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl Univ.Prof. Dipl.-Ing. Dr. Hermann Kaindl]
* [http://www.ads.tuwien.ac.at/people/Kaindl.html Univ.Prof. Dipl.-Ing. Dr.techn. Hermann Kaindl] (2005)
* [http://www.cs.ucl.ac.uk/research/renoir/members/siemens.html Siemens AG Österreich]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:Kaindl_Hermann.jpg|border|right|thumb|link=https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl| Hermann Kaindl <ref>[https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl Univ.Prof. Dipl.-Ing. Dr. Hermann Kaindl]</ref> ]]
'''Hermann Kaindl''',<br/>
an Austrian computer scientist, games researcher and since 2003 full professor at the [[Vienna University of Technology]], where he already defended his Ph.D. under supervision of [[Wilhelm Barth]] <ref>[[Hermann Kaindl]] ('''1981'''). ''Realisierung von langfristigem Planen und Massnahmen gegen den Horizont-Effekt im Computer-Schach''. Doctoral Dissertation. [[Vienna University of Technology]]</ref> <ref>[[Werner Schimanovich|Werner DePauli-Schimanovich]] ('''2006'''). ''Europolis 6''. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, Universitätsverlag Rudolf Trauner, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German), [http://books.google.com/books?id=Gf4WibmHVbcC&pg=PA175&lpg=PA175&source=bl&ots=YPtaHAp3Z4&sig=DNRPh11heo8Q1zS3UOBe0qoCF-8&hl=en&ei=0GmnTMX1GMfJswaL-NivDA&sa=X&oi=book_result&ct=result&resnum=1&ved=0CBgQ6AEwAA#v=onepage&q&f=false Google Books]</ref>. Kaindl was senior consultant with the division of program and systems engineering at [https://en.wikipedia.org/wiki/Siemens Siemens AG] [https://en.wikipedia.org/wiki/Austria Austria] <ref>[https://www.ict.tuwien.ac.at/ict/portal/media-type/html/user/ictverwalt/page/default.psml?js_language=en Univ.Prof. Dipl.-Ing. Dr.techn. Hermann Kaindl]</ref>. Concurrently to his work in the industry, Kaindl has given lectures in computer science at the Technical University of Vienna since 1984, where he received the [https://en.wikipedia.org/wiki/Habilitation venia docendi] in applied computer science ([http://de.wikipedia.org/wiki/Praktische_Informatik Praktische Informatik]) in 1989 <ref>[http://www.cs.ucl.ac.uk/research/renoir/members/siemens.html Siemens AG Österreich]</ref>.
=Merlin=
As student, Hermann Kaindl was primary author of the chess program [[Merlin]], along with [[Helmut Horacek]], [[Marcus Wagner]] and [[Roland Schreier]], competing at various [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]] and two [[World Computer Chess Championship|World Computer Chess Championships]] in the 80s <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=353 Merlin's ICGA Tournaments]</ref>.
=Photos=
[[FILE:ACC5.jpg|none|border|text-bottom|660px]]
[[Advances in Computer Chess 5]] Smalltalk:<br/>[[Hans Berliner]], [[Hermann Kaindl]], [[Helmut Horacek]], [[Adriaan de Groot]] and [[Reiner Seidel]] <ref>Photo by [[László Lindner]], [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]], pp. 117</ref>
=See also=
* [[Merlin]]
* [[Vienna University of Technology]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref><ref>[http://www.ke.informatik.tu-darmstadt.de/~juffi/publications/publications-sel.html Johannes Fürnkranz - Research Areas (Selected Publications)]</ref><ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Kaindl:Hermann.html DBLP: Hermann Kaindl]</ref>
==1978==
* [[Hermann Kaindl]], [[Werner Schimanovich]] ('''1978'''). ''Catrin - Mathematical 2-person-game''. University of Vienna
==1980 ...==
* [[Hermann Kaindl]] ('''1981'''). ''Realisierung von langfristigem Planen und Massnahmen gegen den Horizont-Effekt im Computer-Schach''. Doctoral Dissertation. [[Vienna University of Technology]]
* [[Hermann Kaindl]] ('''1982'''). ''Dynamic Control of the Quiescence Search in Computer Chess''. Cybernetics and Systems Research (ed. R. Trappl), pp. 973-977. North-Holland, Amsterdam. » [[Quiescence Search]]
* [[Hermann Kaindl]] ('''1982'''). ''Positional Long-Range Planning in Computer Chess.'' [[Advances in Computer Chess 3]], also published as [[Hermann Kaindl]] ('''1983'''). ''Positional Long-Range Planning in Computer Chess.'' [[Vienna University of Technology]], Austria.
* [[Hermann Kaindl]] ('''1982'''). ''Quiescence Search in Computer Chess.'' SIGART Newsletter, 80, pp. 124-131. Reprinted (1983) in Computer-Game-Playing: Theory and Practice, pp. 39-52. Ellis Horwood Ltd., Chichester. » [[Quiescence Search]]
* [[Hermann Kaindl]] ('''1983'''). ''Searching to Variable Depth in Computer Chess.'' Proceedings of [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai83.html IJCAI 83], pp. 760-762. Karlsruhe. [http://ijcai.org/Past%20Proceedings/IJCAI-83-VOL-2/PDF/039.pdf pdf]
* [[Hermann Kaindl]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=645759.666297 What Happened with AI's Drosophila]''? [http://www.informatik.uni-trier.de/~ley/db/conf/ogai/ogai1985.html ÖGAI 1985]: 194-203
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Marcus Wagner]] ('''1986'''). ''Selective Search versus Brute Force.'' [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Hermann Kaindl]] ('''1988'''). ''Minimaxing Theory and Practice''. AI Magazine, Vol. 9, No. 3, pp. 69-76. [http://www.aaai.org/ojs/index.php/aimagazine/article/viewFile/944/862 pdf]
* [[Hermann Kaindl]] ('''1988'''). ''Useful Statistics from Tournament Programs''. [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1988'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees: The Details.'' Tech. Report #50, Department of Statistics and Computer Science, [[Vienna University of Technology]], Austria.
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1989'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
* [[Hermann Kaindl]] ('''1989'''). ''Towards a Theory of Knowledge''. [[Advances in Computer Chess 5]]
* [[Hermann Kaindl]], [http://www.arnetminer.org/viewperson.do?naid=276308&name=Anton%20Scheucher Anton Scheucher] ('''1989'''). ''The Reason for the Benefits of Minmax Search''. Proc. of the 11 th IJCAI, pp. 322–327, Detroit, MI.
==1990 ...==
* [[Hermann Kaindl]] ('''1990'''). ''Tree Searching Algorithms''. [[Computers, Chess, and Cognition]], pp. 133-158
* [[Hermann Kaindl]], [[Reza Shams]], [[Helmut Horacek]] ('''1991'''). ''[http://portal.acm.org/citation.cfm?id=123034 Minimax Search Algorithms with and without Aspiration Windows].'' [[IEEE#TPAMI|IEEE Transactions on Pattern Analysis and Machine Intelligence]], Vol. 13, No. 12
* [[Reza Shams]], [[Hermann Kaindl]], [[Helmut Horacek]] ('''1991'''). ''Using Aspiration Windows for Minimax Algorithms''. [[Conferences#IJCAI1991|IJCAI 1991]], [http://ijcai.org/Proceedings/91-1/Papers/031.pdf pdf]
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''Feature Construction during Tree Learning''. [http://www.informatik.uni-trier.de/~ley/db/conf/ki/gwai91.html#KaindlB91 GWAI 1991]: 50-61.
* [[Hermann Kaindl]], [http://www.arnetminer.org/viewperson.do?naid=276308&name=Anton%20Scheucher Anton Scheucher] ('''1992'''). ''Reasons for the Effect of Bounded Look-Ahead Search''. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 22, No. 5, pp. 992-1007.
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1995'''). ''Feature Construction during Tree Learning''. [http://www.informatik.uni-trier.de/~ley/db/conf/gosler/gosler1995.html#MehlsamKB95 GOSLER Final Report] 1995: 391-403
* [[Hermann Kaindl]], Gerhard Kainz, Angelika Leeb, Harald Smetana ('''1995'''). ''How to use limited memory in heuristic search''. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence ([http://137.226.34.227/dblp/db/conf/ijcai/ijcai95.html IJCAI-95]), Montreal, Canada, pp. 236-242. [http://dli.iiit.ac.in/ijcai/IJCAI-95-VOL%201/pdf/031.pdf pdf]
==2000 ...==
* [[Johannes Fürnkranz]], [[Bernhard Pfahringer]], [[Hermann Kaindl]], [[Stefan Kramer]] ('''2000'''). ''[https://scholar.google.com/citations?view_op=view_citation&hl=en&user=0QXx46sAAAAJ&cstart=20&pagesize=80&citation_for_view=0QXx46sAAAAJ:k_IJM867U9cC Learning to Use Operational Advice]''. ECAI-00, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/ecai-00.pdf pdf]
* [[Hermann Kaindl]], [[Stefan Kramer]] ('''2006'''). ''[http://wwwkramer.in.tum.de/research/pubs/kai06kra Are Automated Traceability Checks Needed?]'' ISOneWorld 2006
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=377 Hermann Kaindl's ICGA Tournaments]
* [https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl Univ.Prof. Dipl.-Ing. Dr. Hermann Kaindl]
* [http://www.ads.tuwien.ac.at/people/Kaindl.html Univ.Prof. Dipl.-Ing. Dr.techn. Hermann Kaindl] (2005)
* [http://www.cs.ucl.ac.uk/research/renoir/members/siemens.html Siemens AG Österreich]
=References=
<references />
'''[[People|Up one level]]'''
