25,161
edits
Changes
no edit summary
* [[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'''). ''[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 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 ([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 ...==
