default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVít Musil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]David Klaska, Antonín Kucera
, Vojtech Kur, Vít Musil, Vojtech Rehák:
Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes. AAAI 2024: 20143-20150- [c12]Anselm Paulus, Georg Martius, Vít Musil:
LPGD: A General Framework for Backpropagation through Embedded Optimization Layers. ICML 2024 - [i13]Anselm Paulus, Georg Martius, Vít Musil:
LPGD: A General Framework for Backpropagation through Embedded Optimization Layers. CoRR abs/2407.05920 (2024) - 2023
- [c11]Subham Sekhar Sahoo, Anselm Paulus, Marin Vlastelica, Vít Musil, Volodymyr Kuleshov, Georg Martius:
Backpropagation through Combinatorial Algorithms: Identity with Projection Works. ICLR 2023 - [c10]David Klaska, Antonín Kucera, Martin Kurecka, Vít Musil, Petr Novotný, Vojtech Rehák:
Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. IJCAI 2023: 171-179 - [c9]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
Mean Payoff Optimization for Systems of Periodic Service and Maintenance. IJCAI 2023: 5386-5393 - [i12]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
Mean Payoff Optimization for Systems of Periodic Service and Maintenance. CoRR abs/2305.08555 (2023) - [i11]David Klaska, Antonín Kucera, Martin Kurecka, Vít Musil, Petr Novotný, Vojtech Rehák:
Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. CoRR abs/2305.10070 (2023) - [i10]David Klaska, Antonín Kucera, Vojtech Kur, Vít Musil, Vojtech Rehák:
Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes. CoRR abs/2312.12325 (2023) - 2022
- [c8]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
Minimizing Expected Intrusion Detection Time in Adversarial Patrolling. AAMAS 2022: 1660-1662 - [c7]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
General Optimization Framework for Recurrent Reachability Objectives. IJCAI 2022: 4642-4648 - [c6]Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák:
On-the-fly adaptation of patrolling strategies in changing environments. UAI 2022: 244-254 - [i9]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
Minimizing Expected Intrusion Detection Time in Adversarial Patrolling. CoRR abs/2202.01095 (2022) - [i8]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
General Optimization Framework for Recurrent Reachability Objectives. CoRR abs/2205.14057 (2022) - [i7]Subham Sekhar Sahoo, Marin Vlastelica, Anselm Paulus, Vít Musil, Volodymyr Kuleshov, Georg Martius:
Gradient Backpropagation Through Combinatorial Algorithms: Identity with Projection Works. CoRR abs/2205.15213 (2022) - [i6]Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák:
On-the-fly Adaptation of Patrolling Strategies in Changing Environments. CoRR abs/2206.08096 (2022) - 2021
- [c5]Anselm Paulus, Michal Rolínek, Vít Musil, Brandon Amos, Georg Martius:
CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints. ICML 2021: 8443-8453 - [c4]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
Regstar: efficient strategy synthesis for adversarial patrolling games. UAI 2021: 471-481 - [i5]Anselm Paulus, Michal Rolínek, Vít Musil, Brandon Amos, Georg Martius:
CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints. CoRR abs/2105.02343 (2021) - [i4]David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák:
Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games. CoRR abs/2108.08950 (2021) - 2020
- [c3]Michal Rolínek, Vít Musil, Anselm Paulus, Marin Vlastelica P., Claudio Michaelis, Georg Martius:
Optimizing Rank-Based Metrics With Blackbox Differentiation. CVPR 2020: 7617-7627 - [c2]Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, Vít Musil, Georg Martius:
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers. ECCV (28) 2020: 407-424 - [c1]Marin Vlastelica Pogancic, Anselm Paulus, Vít Musil, Georg Martius, Michal Rolínek:
Differentiation of Blackbox Combinatorial Solvers. ICLR 2020 - [i3]Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, Vít Musil, Georg Martius:
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers. CoRR abs/2003.11657 (2020)
2010 – 2019
- 2019
- [i2]Marin Vlastelica P., Anselm Paulus, Vít Musil, Georg Martius, Michal Rolínek:
Differentiation of Blackbox Combinatorial Solvers. CoRR abs/1912.02175 (2019) - [i1]Michal Rolínek, Vít Musil, Anselm Paulus, Marin Vlastelica P., Claudio Michaelis, Georg Martius:
Optimizing Rank-based Metrics with Blackbox Differentiation. CoRR abs/1912.03500 (2019)
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-07 22:18 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:
