Остановите войну!
for scientists:
default search action
Branislav Bosanský
- > Home > Persons > Branislav Bosanský
Publications
- 2022
- [i12]Tomás Pevný, Viliam Lisý, Branislav Bosanský, Petr Somol, Michal Pechoucek:
Explaining Classifiers Trained on Raw Hierarchical Multiple-Instance Data. CoRR abs/2208.02694 (2022) - 2019
- [j7]Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld, Michal Pechoucek:
Hardening networks against strategic attackers using attack graph games. Comput. Secur. 87 (2019) - 2018
- [j5]Jirí Cermák, Branislav Bosanský, Karel Horák, Viliam Lisý, Michal Pechoucek:
Approximating maxmin strategies in imperfect recall games using A-loss recall property. Int. J. Approx. Reason. 93: 290-326 (2018) - 2017
- [c44]Jiri Cermak, Branislav Bosanský, Michal Pechoucek:
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. AAAI Workshops 2017 - [c42]Karel Horák, Branislav Bosanský, Michal Pechoucek:
Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games. AAAI 2017: 558-564 - [c41]Jirí Cermák, Branislav Bosanský, Michal Pechoucek:
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. AAMAS 2017: 902-910 - [c38]Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek:
Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall. ICAART (2) 2017: 63-74 - 2016
- [j2]Karel Durkota, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský, Michal Pechoucek:
Case Studies of Network Defense with Attack Graph Games. IEEE Intell. Syst. 31(5): 24-30 (2016) - [i3]Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek:
Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall. CoRR abs/1608.01510 (2016) - 2014
- [j1]Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Michal Pechoucek:
An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information. J. Artif. Intell. Res. 51: 829-866 (2014) - 2013
- [c23]Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Jiri Cermak, Michal Pechoucek:
Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games. AAMAS 2013: 335-342 - [c21]Branislav Bosanský, Viliam Lisý, Jiri Cermak, Roman Vitek, Michal Pechoucek:
Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games. IJCAI 2013: 48-54 - 2012
- [c19]Branislav Bosanský, Ondrej Vanek, Michal Pechoucek:
Strategy Representation Analysis for Patrolling Games. AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health 2012 - [c18]Ondrej Vanek, Branislav Bosanský, Michal Jakob, Viliam Lisý, Michal Pechoucek:
Extending Security Games to Defenders with Constrained Mobility. AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health 2012 - [c17]Ondrej Vanek, Zhengyu Yin, Manish Jain, Branislav Bosanský, Milind Tambe, Michal Pechoucek:
Game-theoretic resource allocation for malicious packet detection in computer networks. AAMAS 2012: 905-912 - [c16]Viliam Lisý, Branislav Bosanský, Michal Pechoucek:
Anytime algorithms for multi-agent visibility-based pursuit-evasion games. AAMAS 2012: 1301-1302 - [c15]Peter Novák, Antonín Komenda, Viliam Lisý, Branislav Bosanský, Michal Cáp, Michal Pechoucek:
Tactical operations of multi-robot teams in urban warfare (demonstration). AAMAS 2012: 1473-1474 - [c14]Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Michal Pechoucek:
Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information. ECAI 2012: 193-198 - [c13]Viliam Lisý, Radek Píbil, Jan Stiborek, Branislav Bosanský, Michal Pechoucek:
Game-theoretic Approach to Adversarial Plan Recognition. ECAI 2012: 546-551 - [c12]Radek Píbil, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský, Michal Pechoucek:
Game Theoretic Model of Strategic Honeypot Selection in Computer Networks. GameSec 2012: 201-220 - 2011
- [c11]Branislav Bosanský, Viliam Lisý, Michal Jakob, Michal Pechoucek:
Computing time-dependent policies for patrolling games with mobile targets. AAMAS 2011: 989-996 - [c10]Ondrej Vanek, Michal Jakob, Viliam Lisý, Branislav Bosanský, Michal Pechoucek:
Iterative game-theoretic route selection for hostile area transit and patrolling. AAMAS 2011: 1273-1274 - [c9]Michal Jakob, Ondrej Vanek, Branislav Bosanský, Ondrej Hrstka, Michal Pechoucek:
AgentC: agent-based system for securing maritime transit. AAMAS 2011: 1309-1310 - [c8]Branislav Bosanský, Viliam Lisý, Michal Pechoucek:
Towards Cooperation in Adversarial Search with Confidentiality. HoloMAS 2011: 246-255 - 2010
- [c6]Ondrej Vanek, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Transiting areas patrolled by a mobile adversary. CIG 2010: 9-16 - [c5]Viliam Lisý, Branislav Bosanský, Roman Vaculín, Michal Pechoucek:
Agent subset adversarial search for complex non-cooperative domains. CIG 2010: 211-218 - 2009
- [c4]Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Adversarial search with procedural knowledge heuristic. AAMAS (2) 2009: 899-906 - [c3]Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Goal-based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic. ICAART 2009: 53-60 - [c2]Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Goal-Based Game Tree Search for Complex Domains. ICAART (Revised Selected Papers) 2009: 97-109
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-18 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint