Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Minimax search"'
Publikováno v:
IEEE Access, Vol 7, Pp 102931-102940 (2019)
Many areas of exploratory data analysis need to deal with high-dimensional data sets. Some real life data like human gene have an inherent structure of hierarchy, which embeds multi-layer feature groups. In this paper, we propose an algorithm to sear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6144d9e710ae081154f757a8614ea11a
https://doi.org/10.1109/access.2019.2924491
https://doi.org/10.1109/access.2019.2924491
Autor:
Mokhamad Belal Alabdullakh, Timur Mansurovich Alimov, Radzhikh Ziad Kattavi, Akhmed Khusham khusam Alkhuzaii
Publikováno v:
Interactive science. :10-12
The article presents the classical saddle-point problem in a two-dimensional array. Such tasks are highly demanded in geodesy, in the construction of topographic or gravimetric maps of the terrain, in the energy sector – in planning the load on ele
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d92bef01be2d654a2d7fe456d61f5cce
https://doi.org/10.21661/r-497643
https://doi.org/10.21661/r-497643
Publikováno v:
ICAART (2)
In a two-person perfect-information game, Conspiracy Number Search (CNS) was invented as a possible search algorithm but did not find much success. However, we believe that the conspiracy number, which is the core of CNS, has not been used to its ful
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9de4f8af756ed2549f0e78b241155a8d
http://hdl.handle.net/10119/14764
http://hdl.handle.net/10119/14764
Publikováno v:
Journal of Global Optimization
Journal of Global Optimization, Springer Verlag, 2016, 64 (4), pp.785-802. ⟨10.1007/s10898-015-0344-x⟩
Journal of Global Optimization, Springer Verlag, 2016, 64 (4), pp.785-802. ⟨10.1007/s10898-015-0344-x⟩
International audience; Worst-case design is important whenever robustness to adverse environmental conditions must be ensured regardless of their probability. It leads to minimax optimization, which is most often treated assuming that prior knowledg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d9215b054c633d8822fa16139c57d13
https://doi.org/10.1007/s10898-015-0344-x
https://doi.org/10.1007/s10898-015-0344-x
Autor:
Takumi Baba, Takeshi Ito
Publikováno v:
TAAI
Dice-Shogi is a new game that adds uncertainty elements by dice to Mini-Shogi. In this research, we applied * - Minimax search to Dice-Shogi, implemented Star1, Star2, Star2.5 and examined its performance. As the result, it showed that Star2 can sear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3682ddd95c466825599fae23824215f
https://doi.org/10.1109/taai.2017.49
https://doi.org/10.1109/taai.2017.49
Publikováno v:
Advanced Information Systems Engineering ISBN: 9783319595351
CAiSE
CAiSE
A robust machinery for process enactment should ideally be able to anticipate and account for possible ways in which the execution environment might impede a process from achieving its desired effects or outcomes. At critical decision points in a pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7dccb215a59c4a6d88f11633d0b0081
https://doi.org/10.1007/978-3-319-59536-8_29
https://doi.org/10.1007/978-3-319-59536-8_29
Publikováno v:
Theoretical Computer Science. 422:59-77
Minimax search, which is used by most game-playing programs, is considered pathological when deeper searches produce worse evaluations than shallower ones. This phenomenon was first observed in theoretical analyses under seemingly reasonable conditio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8d66d3a4e6df9edd768064a24f46e0d
https://doi.org/10.1016/j.tcs.2011.11.033
https://doi.org/10.1016/j.tcs.2011.11.033
Autor:
Vladan Vuckovic
Publikováno v:
2015 12th International Conference on Telecommunication in Modern Satellite, Cable and Broadcasting Services (TELSIKS).
This paper presents the Candidate Moves Method for parallelization of the MiniMax search procedure. As the framework for this new method the basic MiniMax procedure is defined. The original modification of the classic MiniMax procedure is presented i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::493814c263e92061a00f046c1f542a79
https://doi.org/10.1109/telsks.2015.7357795
https://doi.org/10.1109/telsks.2015.7357795
Publikováno v:
Theoretical Computer Science. 349:268-281
This article presents the results of experiments designed to gain insight into the effect of the minimax algorithm on the error of a heuristic evaluation function. Two types of effect of minimax are considered: (a) evaluation accuracy (Are the minima
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34980f6337186b509c6d25894ef6398f
https://doi.org/10.1016/j.tcs.2005.09.073
https://doi.org/10.1016/j.tcs.2005.09.073
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.