Changes

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>.

[[FILE:ACC5.jpg|none|border|text-bottom|660px640px]]

<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf [ICGA Journal#RefDB|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 DBLPdblp: Hermann Kaindl]</ref>

* [[Hermann Kaindl]] ('''1983'''). ''Searching to Variable Depth in Computer Chess.'' Proceedings of . [[http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai83.html Conferences#IJCAI1983|IJCAI 831983], pp. 760-762. Karlsruhe. [http://ijcai.org/Past%20Proceedings/IJCAI-83-VOL-2/PDF/039.pdf pdf]* [[Hermann Kaindl]] ('''1985'''). ''[httphttps://portallink.acmspringer.orgcom/chapter/citation10.cfm?id=645759.666297 1007%2F978-3-642-46552-9_22 What Happened with AI's Drosophila]''? [httphttps://www.informatiklink.uni-trierspringer.decom/~leybook/db10.1007/conf/ogai/ogai1985.html 978-3-642-46552-9 ÖGAI 1985]: 194-203

* [[Hermann Kaindl]] ('''1988'''). ''Minimaxing Theory and Practice''. [[AAAI#AIMAG|AI Magazine]], Vol. 9, No. 3, pp. 69-76. [http://www.aaai.org/ojs/index.php/aimagazine/article/viewFile/944/862 pdf]

* [[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 [[Conferences#IJCAI1989|IJCAI, pp. 322–327, Detroit, MI.1989]]

* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-02711-0_6 Feature Construction during Tree Learning]''. [httphttps://www.informatikdblp.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#SMC|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''. [httphttps://www.informatikdblp.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 [[Conferences#IJCAI1995|IJCAI 1995]]* [[Anton Scheucher]], [[Hermann Kaindl]] ('''1998'''). ''[httphttps://137.226www.34sciencedirect.227com/dblpscience/dbarticle/confpii/ijcai/ijcai95.html IJCAI-95S0004370297000738 Benefits of Using Multivalued Functions for Minimaxing]), Montreal, Canada, pp. 236-242''. [httphttps://dlien.iiitwikipedia.ac.inorg/ijcaiwiki/IJCAI-95-VOL%201/pdf/031Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 99, No.pdf pdf]2

* [[Hermann Kaindl]], [[Stefan Kramer]] ('''2006'''). ''Are Automated Traceability Checks Needed?'' ISOneWorld 2006==2010 ...==* [[Hermann Kaindl]], [[httpHelmut Horacek]], [[Anton Scheucher]] ('''2017'''). ''[https://wwwkramerieeexplore.ieee.org/document/7358032 Product Propagation: A Back-up Rule Better than Minimaxing?]'' [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI inGames]], Vol. 9, No.tum2, [[:File:KaindlProductPropagation.depdf|pdf]]* [[Hermann Kaindl]] ('''2018'''). ''[https://cacm.acm.org/magazines/2018/12/232884-reclaim-internet-greatness/fulltext Comment - Lookahead Search for Computer Chess]''. [[ACM#Communications|Communications of the ACM]], Vol. 61, No. 12 » [[AlphaZero]] <ref>Comment concerning [[AlphaZero]] on [[Mathematician#VGCerf|Vinton G. Cerf]] ('''2018'''). ''[https://cacm.acm.org/magazines/research2018/pubs7/kai06kra Are Automated Traceability Checks Needed?229041-on-neural-networks/fulltext On Neural Networks]'' ISOneWorld 2006. [[ACM#Communications|Communications of the ACM]], Vol. 61, No. 7</ref>