Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Viliam Lisy"'
Autor:
Viliam Lisy
Publikováno v:
Acta Polytechnica, Vol 54, Iss 5, Pp 333-340 (2014)
We evaluate the performance of various selection methods for the Monte Carlo Tree Search algorithm in two-player zero-sum extensive-form games with imperfect information. We compare the standard Upper Confident Bounds applied to Trees (UCT) along wit
Externí odkaz:
https://doaj.org/article/ea8d8dc2555c4a96a8457d749605c1f8
Publikováno v:
IEEE Intelligent Systems. 31:24-30
The increasing complexity of securing modern computer networks makes decision support systems an important tool for administrators. A challenge many existing tools fail to address is that attackers react strategically to new security measures, adapti
Publikováno v:
Security and Communication Networks, Vol 2018 (2018)
Moving target defense (MTD) strategies have been widely studied for securing computer systems. We consider using MTD strategies to provide long-term cryptographic security for message transmission against an eavesdropping adversary who has access to
Publikováno v:
MTD@CCS
Moving target defense (MTD) strategies have been widely studied for securing computer communication systems. We consider using MTD strategies as a cryptographic mechanism for providing secure communication when the adversary has access to a quantum c
Autor:
Thanh H. Nguyen, Reuth Mirsky, Sarah Keren, Maria Gini, Aaron Isaksen, William W. Streilein, Arash Shaban-Nejad, Christopher W. Geib, Rodney Martin, Michael Thielscher, Roman Barták, Monica Anderson, Shirin Sohrabi, Byron C. Wallace, Julian Togelius, Arunesh Sinha, Jichen Zhu, Mark J. Stefik, Scott Sanner, Szymon Wilk, So Cao Tran, David L. Buckeridge, Michael J. Paul, Hoda Eldardiry, David R. Martinez, Nathan R. Sturtevant, Martin Michalowski, John S. Brownstein, Kumar Sricharan, Long Tran-Thanh, Viliam Lisy, Loizos Michael, Enrico Pontelli, Neal Wagner, Robert Laddaga, Biplav Srivastava, Kartik Talamadupula
Publikováno v:
AI Magazine; Vol 38 No 3: Fall 2017; 72-82
The AAAI-17 workshop program included 17 workshops covering a wide range of topics in AI. Workshops were held Sunday and Monday, February 4-5, 2017 at the Hilton San Francisco Union Square in San Francisco, California, USA. This report contains summa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90c9bbdcfac0a3415c9cd72fd1db71f2
http://aaai.org/ojs/index.php/aimagazine/article/view/2755
http://aaai.org/ojs/index.php/aimagazine/article/view/2755
Publikováno v:
IJCAI
We solve large two-player zero-sum extensive-form games with perfect recall. We propose a new algorithm based on fictitious play that significantly reduces memory requirements for storing average strategies. The key feature is exploiting imperfect re
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 30
Strong Stackelberg Equilibrium (SSE) is a fundamental solution concept in game theory in which one player commits to a strategy, while the other player observes this commitment and plays a best response. We present a new algorithm for computing SSE f
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 30
Many real world security problems can be modelled as finite zero-sum games with structured sequential strategies and limited interactions between the players. An abstract class of games unifying these models are the normal-form games with sequential
Publikováno v:
CIG
We investigate reduction of the complexity of a multi-agent adversarial search in the domain of n-player games. We describe a method that decomposes the game into a set of smaller overlapping sub-games, solves each sub-game separately, and then combi
Publikováno v:
ICTAI (1)
Mobile robot localization is taken into account as one of the most important topics in robotics. In this paper, the localization problem is extended to the cases in which estimating the position of multi robots is considered. To do so, the joint prob