Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Donkers, H.H.L.M"'
Publikováno v:
In Theoretical Computer Science 2005 349(2):245-267
Publikováno v:
In Information Sciences 2003 154(3):119-140
Publikováno v:
In Information Sciences 2001 135(3):123-149
Autor:
Houtum, H.J. van, Donkers, H.H.L.M., Boekema, F.W.M., Hassink, R.J., Corvers, F., Tillaart, H.J.M. van den
Publikováno v:
Tijdschrift voor Economie en Management, pp. 535-560
Tijdschrift voor Economie en Management, 41, 4, pp. 534-561
Tijdschrift voor Economie en Management, XLI(4), 534-561
Tijdschrift voor Economie en Management, 535-560
STARTPAGE=535;ENDPAGE=560;ISSN=0772-7674;TITLE=Tijdschrift voor Economie en Management
Tijdschrift voor Economie en Management, 41, 534-561
Tijdschrift voor Economie en Management, 41, 4, pp. 534-561
Tijdschrift voor Economie en Management, XLI(4), 534-561
Tijdschrift voor Economie en Management, 535-560
STARTPAGE=535;ENDPAGE=560;ISSN=0772-7674;TITLE=Tijdschrift voor Economie en Management
Tijdschrift voor Economie en Management, 41, 534-561
Contains fulltext : 74488.pdf (Publisher’s version ) (Open Access)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6a2e06051ee70d68c6838ddb332da3eb
https://hdl.handle.net/2066/74488
https://hdl.handle.net/2066/74488
Autor:
Kocsis, L., Szepesvari, C.S., Winands, M.H.M., van den Herik, H.J., Hsu, S.C., Donkers, H.H.L.M.
Publikováno v:
Advances in Computer Games. ACG 2005., 39-56
STARTPAGE=39;ENDPAGE=56;TITLE=Advances in Computer Games. ACG 2005.
Lecture Notes in Computer Science ISBN: 9783540488873
ACG
STARTPAGE=39;ENDPAGE=56;TITLE=Advances in Computer Games. ACG 2005.
Lecture Notes in Computer Science ISBN: 9783540488873
ACG
Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization algorithms in game programs are interesting research domains. However,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3c7f52dca3adccdb199ad42f41ec38c
https://cris.maastrichtuniversity.nl/en/publications/102a53e7-50ac-4993-bf02-c109463fdd43
https://cris.maastrichtuniversity.nl/en/publications/102a53e7-50ac-4993-bf02-c109463fdd43
Autor:
Donkers, H.H.L.M., van den Herik, H.J., Uiterwijk, J.W.H.M., Herik, H.J. van den, Hsu, Y.S-C., Hsu, T-s.
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540488873
ACG
Advances in Computer Games. ACG 2005
ACG
Advances in Computer Games. ACG 2005
In this paper we introduce a new pruning mechanism, called Similarity Pruning for Probabilistic Opponent-Model (PrOM) Search. It is based on imposing a bound on the differences between two or more evaluation functions. Assuming such a bound exists, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6eae7d1bb2eb021137dc3a2f9df28e08
https://doi.org/10.1007/11922155_5
https://doi.org/10.1007/11922155_5
Publikováno v:
Entertainment Computing – ICEC 2004 ISBN: 9783540229476
ICEC
ENTERTAINMENT COMPUTING-ICEC 2004, 3166, 409-419
Proceedings International Conference on Entertainment Computing-ICEC 2004, 409-419
STARTPAGE=409;ENDPAGE=419;TITLE=Proceedings International Conference on Entertainment Computing-ICEC 2004
ICEC
ENTERTAINMENT COMPUTING-ICEC 2004, 3166, 409-419
Proceedings International Conference on Entertainment Computing-ICEC 2004, 409-419
STARTPAGE=409;ENDPAGE=419;TITLE=Proceedings International Conference on Entertainment Computing-ICEC 2004
In Probabilistic Opponent-Model search (PrOM search) the opponent is modelled by a mixed strategy of N opponent types omega(0) ... omega(N-1). The opponent is assumed to adopt at every move one of the opponent types 0, according to the probability Pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1ac8485713756a3d58ec036325c3a63
https://doi.org/10.1007/978-3-540-28643-1_53
https://doi.org/10.1007/978-3-540-28643-1_53
Autor:
Donkers, H.H.L.M., van den Herik, H.J.
Publikováno v:
ERCIM News, 57, April, 42-43. European Research Consortium for Informatics and Mathematics
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::969de2c7a2383c373a8154d1a1eebdec
https://cris.maastrichtuniversity.nl/en/publications/701d3b23-efea-427c-9963-fd2661902e1e
https://cris.maastrichtuniversity.nl/en/publications/701d3b23-efea-427c-9963-fd2661902e1e
Publikováno v:
Advances in Computer Games ISBN: 9781475744248
Advances in Computer Games
Advances in Computer Games
Opponent-model search is a game-tree search method that explicitly uses knowledge of the opponent. There is some risk involved in using opponent-model search. Both the prediction of the opponent’s moves and the estimation of the profitability of fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44f1afb8b20c3e17296b8f063f15b926
https://doi.org/10.1007/978-0-387-35706-5_20
https://doi.org/10.1007/978-0-387-35706-5_20
Autor:
Donkers, H.H.L.M., Uiterwijk, J.W.H.M.
Publikováno v:
Pythagoras, 42. Wolters-Noordhoff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::f8fdc77526532390a729f9a664d99bdf
https://cris.maastrichtuniversity.nl/en/publications/1b1314eb-ebf0-41d4-bb9b-ce0fc6e0dc36
https://cris.maastrichtuniversity.nl/en/publications/1b1314eb-ebf0-41d4-bb9b-ce0fc6e0dc36