( en | de | ru )

 

Disambiguation of "Bosanský, Branislav"

Author of the publication

copydeleteadd this publication to your clipboard
Avast-CTU Public CAPE Dataset.

, , , , , , and . CoRR, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Branislav Radovic

Branislav Sloboda

Branislav Krljanac

Branislav Hodjera

Branislav Jozefíni

 

Other publications of authors with the same name

Avast-CTU Public CAPE Dataset., , , , , , and . CoRR, (2022)When Players Affect Target Values: Modeling and Solving Dynamic Partially Observable Security Games., , , and . GameSec, volume 11836 of Lecture Notes in Computer Science, page 542-562. Springer, (2019)An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games., , and . IJCAI, page 936-942. ijcai.org, (2017)Solving adversarial patrolling games with bounded error: (extended abstract)., , , , , and . AAMAS, page 1617-1618. IFAAMAS/ACM, (2014)Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium., , , and . IJCAI, page 246-253. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games., and . GameSec, volume 9996 of Lecture Notes in Computer Science, page 435-454. Springer, (2016)Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games., , , , and . AAMAS, page 335-342. IFAAMAS, (2013)Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall., , , and . ICAART (2), page 63-74. SciTePress, (2017)Goal-Based Game Tree Search for Complex Domains., , , and . ICAART (Revised Selected Papers), volume 67 of Communications in Computer and Information Science, page 97-109. Springer, (2009)Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games., , and . AAAI Workshops, volume WS-17 of AAAI Technical Report, AAAI Press, (2017)