Martin Chmelík
Martin Chmelík
Software Engineer, Google
Dirección de correo verificada de
Citado por
Citado por
Scheduling Real-Time Communication in IEEE 802.1 Qbv Time Sensitive Networks
SS Craciunas, RS Oliver, M Chmelík, W Steiner
Proceedings of the 24th International Conference on Real-Time Networks and …, 2016
Verification of Markov decision processes using learning algorithms
T Brázdil, K Chatterjee, M Chmelik, V Forejt, J Křetínský, M Kwiatkowska, ...
International Symposium on Automated Technology for Verification and …, 2014
What is decidable about partially observable Markov decision processes with ω-regular objectives
K Chatterjee, M Chmelík, M Tracol
Journal of Computer and System Sciences 82 (5), 878-911, 2016
Optimal cost almost-sure reachability in POMDPs
K Chatterjee, M Chmelík, R Gupta, A Kanodia
Artificial Intelligence 234, 26-48, 2016
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K Chatterjee, M Chmelík, R Gupta, A Kanodia
2015 IEEE International Conference on Robotics and Automation (ICRA), 325-330, 2015
Efficient strategies for calculating blockwise likelihoods under the coalescent
K Lohse, M Chmelik, SH Martin, NH Barton
Genetics 202 (2), 775-786, 2016
A symbolic sat-based algorithm for almost-sure reachability with small strategies in pomdps
K Chatterjee, M Chmelik, J Davies
Thirtieth AAAI Conference on Artificial Intelligence, 2016
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
M Svoreňová, J Křetínský, M Chmelík, K Chatterjee, I Černá, C Belta
Nonlinear Analysis: Hybrid Systems 23, 230-253, 2017
Temporal logic motion planning using POMDPs with parity objectives: case study paper
M Svoreňová, M Chmelík, K Leahy, HF Eniser, K Chatterjee, I Černá, ...
Proceedings of the 18th International Conference on Hybrid Systems …, 2015
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
T Brázdil, K Chatterjee, M Chmelík, A Fellner, J Křetínský
International Conference on Computer Aided Verification, 158-177, 2015
POMDPs under probabilistic semantics
K Chatterjee, M Chmelík
Artificial Intelligence 221, 46-72, 2015
Interface simulation distances
P Černý, M Chmelik, TA Henzinger, A Radhakrishna
Theoretical Computer Science 560, 348-363, 2014
Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications
K Chatterjee, M Chmelík, D Karkhanis, P Novotný, A Royer
Proceedings of the International Conference on Automated Planning and …, 2020
CEGAR for qualitative analysis of probabilistic systems
K Chatterjee, M Chmelík, P Daca
International Conference on Computer Aided Verification, 473-490, 2014
Stochastic Shortest Path with Energy Constraints in POMDPs
T Brázdil, K Chatterjee, M Chmelík, A Gupta, P Novotný
Proceedings of the 2016 International Conference on Autonomous Agents …, 2016
Deciding Non–local Choice in High–level Message Sequence Charts
M Chmelık
Bachelor’s Thesis, Faculty of Informatics, Masaryk University, 2009
CEGAR for compositional analysis of qualitative properties in Markov decision processes
K Chatterjee, M Chmelík, P Daca
Formal Methods in System Design 47 (2), 230-264, 2015
Sensor Synthesis for POMDPs with Reachability Objectives
K Chatterjee, M Chmelik, U Topcu
Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018
Indefinite-horizon reachability in Goal-DEC-POMDPs
K Chatterjee, M Chmelík
Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016
Controllable-choice message sequence graphs
M Chmelík, V Řehák
International Doctoral Workshop on Mathematical and Engineering Methods in …, 2012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20