default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarel Horák 0002
Person information
- affiliation: Czech Technical University in Prague (CTU), Artificial Intelligence Center, Prague, Czech Republic
Other persons with the same name
- Karel Horák — disambiguation page
- Karel Horák 0001
![[0000-0002-2280-3029]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2280-3029")
— Brno University of Technology, Department of Control and Instrumentation, Brno, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Petr Tomásek, Karel Horák, Branislav Bosanský:
Iterative algorithms for solving one-sided partially observable stochastic shortest path games. Int. J. Approx. Reason. 175: 109297 (2024)- 2023
- [j3]Karel Horák, Branislav Bosanský, Vojtech Kovarík, Christopher Kiekintveld:
Solving zero-sum one-sided partially observable stochastic games. Artif. Intell. 316: 103838 (2023) - 2021
- [c11]Petr Tomásek, Karel Horák, Aditya Aradhye, Branislav Bosanský, Krishnendu Chatterjee:
Solving Partially Observable Stochastic Shortest-Path Games. IJCAI 2021: 4182-4189 - 2020
- [c10]Olga Petrova, Karel Durkota, Galina Alperovich, Karel Horák, Michal Najman, Branislav Bosanský, Viliam Lisý:
Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. AAMAS 2020: 1969-1971 - [i5]Olga Petrova, Karel Durkota, Galina Alperovich, Karel Horák, Michal Najman, Branislav Bosanský, Viliam Lisý:
Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. CoRR abs/2004.10638 (2020) - [i4]Karel Horák, Branislav Bosanský, Vojtech Kovarík, Christopher Kiekintveld:
Solving Zero-Sum One-Sided Partially Observable Stochastic Games. CoRR abs/2010.11243 (2020)
2010 – 2019
- 2019
- [j2]Karel Horák, Branislav Bosanský, Petr Tomásek, Christopher Kiekintveld, Charles A. Kamhoua:
Optimizing honeypot strategies against dynamic lateral movement using partially observable stochastic games. Comput. Secur. 87 (2019) - [c9]Karel Horák, Branislav Bosanský:
Solving Partially Observable Stochastic Games with Public Observations. AAAI 2019: 2029-2036 - [c8]Karel Horák, Branislav Bosanský, Christopher Kiekintveld, Charles A. Kamhoua:
Compact Representation of Value Function in Partially Observable Stochastic Games. IJCAI 2019: 350-356 - [i3]Karel Horák, Branislav Bosanský, Christopher Kiekintveld, Charles A. Kamhoua:
Compact Representation of Value Function in Partially Observable Stochastic Games. CoRR abs/1903.05511 (2019) - 2018
- [j1]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) - [c7]Karel Horák, Branislav Bosanský, Krishnendu Chatterjee:
Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. IJCAI 2018: 4764-4770 - 2017
- [c6]Karel Horák, Branislav Bosanský, Michal Pechoucek:
Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games. AAAI 2017: 558-564 - [c5]Karel Durkota, Viliam Lisý, Christopher Kiekintveld, Karel Horák, Branislav Bosanský, Tomás Pevný:
Optimal Strategies for Detecting Data Exfiltration by Internal and External Attackers. GameSec 2017: 171-192 - [c4]Karel Horák, Quanyan Zhu, Branislav Bosanský:
Manipulating Adversary's Belief: A Dynamic Game Approach to Deception by Design for Proactive Network Security. GameSec 2017: 273-294 - [c3]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 - [c2]Karel Horák, Branislav Bosanský:
Dynamic Programming for One-sided Partially Observable Pursuit-evasion Games. ICAART (2) 2017: 503-510 - 2016
- [c1]Karel Horák, Branislav Bosanský:
A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games. GameSec 2016: 435-454 - [i2]Karel Horák, Branislav Bosanský:
Dynamic Programming for One-Sided Partially Observable Pursuit-Evasion Games. CoRR abs/1606.06271 (2016) - [i1]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)
Coauthor Index
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-10-23 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
