Difference between revisions of "Matjaž Gams"

From Chessprogramming wiki
Jump to: navigation, search
Line 26: Line 26:
 
* [[Mitja Luštrek]], [[Matjaž Gams]], [[Ivan Bratko]] ('''2006'''). ''Is Real-Valued Minimax Pathological''? [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 170, [https://dis.ijs.si/MitjaL/documents/Is_Real-Valued_Minimax_Pathological-AIJ-06.pdf pdf]
 
* [[Mitja Luštrek]], [[Matjaž Gams]], [[Ivan Bratko]] ('''2006'''). ''Is Real-Valued Minimax Pathological''? [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 170, [https://dis.ijs.si/MitjaL/documents/Is_Real-Valued_Minimax_Pathological-AIJ-06.pdf pdf]
 
==2010 ...==
 
==2010 ...==
* [[Dana Nau|Dana S. Nau]], [[Mitja Luštrek]], [[Austin Parker]], [[Ivan Bratko]], [[Matjaž Gams]] ('''2010'''). ''When is it better not to look ahead?''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 174, No. 16–17, [http://www.cs.umd.edu/~nau/papers/nau2010when.pdf pdf], [https://dis.ijs.si/mitjal/documents/Nau-When_is_it_better_not_to_look_ahead-AIJ-10.pdf pdf preprint]
+
* [[Dana S. Nau]], [[Mitja Luštrek]], [[Austin Parker]], [[Ivan Bratko]], [[Matjaž Gams]] ('''2010'''). ''When is it better not to look ahead?''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 174, No. 16–17, [http://www.cs.umd.edu/~nau/papers/nau2010when.pdf pdf], [https://dis.ijs.si/mitjal/documents/Nau-When_is_it_better_not_to_look_ahead-AIJ-10.pdf pdf preprint]
 
* [[Mitja Luštrek]], [[Ivan Bratko]], [[Matjaž Gams]] ('''2011'''). ''Independent-valued minimax : Pathological or beneficial?'' [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_%28journal%29 Theoretical Computer Science], Vol. 422, [https://dis.ijs.si/mitjal/documents/Independent-valued_minimax-Pathological_or_beneficial-TCS-12.pdf pdf]
 
* [[Mitja Luštrek]], [[Ivan Bratko]], [[Matjaž Gams]] ('''2011'''). ''Independent-valued minimax : Pathological or beneficial?'' [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_%28journal%29 Theoretical Computer Science], Vol. 422, [https://dis.ijs.si/mitjal/documents/Independent-valued_minimax-Pathological_or_beneficial-TCS-12.pdf pdf]
 
* [[Matjaž Gams]] ('''2018'''). ''IJCAI 2018 - Chinese Dominance Established''. [https://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI42.html Informatica (Slovenia), Vol. 42], No. 3 » [[Conferences#IJCAI2018|IJCAI 2018]], [[WCCC 2018]]
 
* [[Matjaž Gams]] ('''2018'''). ''IJCAI 2018 - Chinese Dominance Established''. [https://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI42.html Informatica (Slovenia), Vol. 42], No. 3 » [[Conferences#IJCAI2018|IJCAI 2018]], [[WCCC 2018]]

Revision as of 11:50, 19 February 2019

Home * People * Matjaž Gams

Matjaž Gams [1]

Matjaž Gams,
a Slovenian computer scientist and researcher in artificial intelligence at Department of Intelligent systems [2], Jožef Stefan Institute, Ljubljana, member of the National Council of the Republic of Slovenia, its councillor for science and research, and member of AAAI, IEEE and ACM [3]. His research interests include machine learning, intelligent agents, multiple knowledge representations, AI and cognitive sciences. He also researched and published on computer chess and game topics, and along with Ivan Bratko due to their Ph.D. student Mitja Luštrek on pathology in heuristic search algorithms.

Selected Publications

[4] [5]

1978

  • Matjaž Gams (1978). Computer-generated Chess End-games. B.Sc. thesis

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level