default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Schmid
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]David Sychrovsky, Michal Sustr, Elnaz Davoodi, Michael Bowling, Marc Lanctot, Martin Schmid:
Learning Not to Regret. AAAI 2024: 15202-15210- [c21]Florian Frank
, Martin Schmid, Felix Klement, Purushothaman Palani, Andreas Weber, Elif Bilge Kavun, Wenjie Xiong, Tolga Arul, Stefan Katzenbeisser:
Secure Data-Binding in FPGA-based Hardware Architectures utilizing PUFs. AsiaCCS 2024 - [i16]Radovan Haluska, Martin Schmid:
Learning to Beat ByteRL: Exploitability of Collectible Card Game Agents. CoRR abs/2404.16689 (2024) - 2023
- [j8]Jonathan Terfurth, Marcel Waldhof, Martin Schmid, Julius Weber, Marina Keller, Nejila Parspour:
Design and Evaluation of a Spatially Distributed and Gear-Integrated Transverse Flux Machine. IEEE Trans. Ind. Electron. 70(5): 5065-5073 (2023) - [c20]Martin Schmid, Elif Bilge Kavun:
Analyzing ModuloNET Against Transition Effects. COINS 2023: 1-6 - [c19]Vojtech Kovarík, Martin Schmid, Neil Burch, Michael Bowling, Viliam Lisý:
Rethinking Formal Models of Partially Observable Multiagent Decision Making (Extended Abstract). IJCAI 2023: 6920-6924 - [i15]David Sychrovsky, Michal Sustr, Elnaz Davoodi, Marc Lanctot, Martin Schmid:
Learning not to Regret. CoRR abs/2303.01074 (2023) - 2022
- [j7]Vojtech Kovarík, Martin Schmid, Neil Burch, Michael Bowling, Viliam Lisý:
Rethinking formal models of partially observable multiagent decision making. Artif. Intell. 303: 103645 (2022) - [j6]Fabian Bärenbold, Rolf Kipfer, Martin Schmid:
Dynamic modelling provides new insights into development and maintenance of Lake Kivu's density stratification. Environ. Model. Softw. 147: 105251 (2022) - [c18]Finbarr Timbers, Nolan Bard, Edward Lockhart, Marc Lanctot, Martin Schmid, Neil Burch, Julian Schrittwieser, Thomas Hubert, Michael Bowling:
Approximate Exploitability: Learning a Best Response. IJCAI 2022: 3487-3493 - 2021
- [c17]Samuel Sokota, Edward Lockhart, Finbarr Timbers, Elnaz Davoodi, Ryan D'Orazio, Neil Burch, Martin Schmid, Michael Bowling, Marc Lanctot:
Solving Common-Payoff Games with Approximate Policy Iteration. AAAI 2021: 9695-9703 - [c16]Michal Sustr, Martin Schmid, Matej Moravcík, Neil Burch, Marc Lanctot, Michael Bowling:
Sound Algorithms in Imperfect Information Games. AAMAS 2021: 1674-1676 - [i14]Samuel Sokota, Edward Lockhart, Finbarr Timbers, Elnaz Davoodi, Ryan D'Orazio, Neil Burch, Martin Schmid, Michael Bowling, Marc Lanctot:
Solving Common-Payoff Games with Approximate Policy Iteration. CoRR abs/2101.04237 (2021) - [i13]Martin Schmid:
Search in Imperfect Information Games. CoRR abs/2111.05884 (2021) - [i12]Martin Schmid, Matej Moravcik, Neil Burch, Rudolf Kadlec, Joshua Davidson, Kevin Waugh, Nolan Bard, Finbarr Timbers, Marc Lanctot, G. Zacharias Holland, Elnaz Davoodi, Alden Christianson, Michael Bowling:
Player of Games. CoRR abs/2112.03178 (2021) - 2020
- [c15]Trevor Davis, Martin Schmid, Michael Bowling:
Low-Variance and Zero-Variance Baselines for Extensive-Form Games. ICML 2020: 2392-2401 - [i11]Finbarr Timbers, Edward Lockhart, Martin Schmid, Marc Lanctot, Michael Bowling:
Approximate exploitability: Learning a best response in large games. CoRR abs/2004.09677 (2020) - [i10]Michal Sustr, Martin Schmid, Matej Moravcík, Neil Burch, Marc Lanctot, Michael Bowling:
Sound Search in Imperfect Information Games. CoRR abs/2006.08740 (2020) - [i9]Audrunas Gruslys, Marc Lanctot, Rémi Munos, Finbarr Timbers, Martin Schmid, Julien Pérolat, Dustin Morrill, Vinícius Flores Zambaldi, Jean-Baptiste Lespiau, John Schultz, Mohammad Gheshlaghi Azar, Michael Bowling, Karl Tuyls:
The Advantage Regret-Matching Actor-Critic. CoRR abs/2008.12234 (2020)
2010 – 2019
- 2019
- [j5]Guy Barash, Mauricio Castillo-Effen, Niyati Chhaya, Peter Clark, Huáscar Espinoza, Eitan Farchi, Christopher W. Geib, Odd Erik Gundersen, Seán Ó hÉigeartaigh, José Hernández-Orallo, Chiori Hori, Xiaowei Huang, Kokil Jaidka, Pavan Kapanipathi, Sarah Keren, Seokhwan Kim, Marc Lanctot, Danny Lange, Julian J. McAuley, David R. Martinez, Marwan Mattar, Mausam, Martin Michalowski, Reuth Mirsky, Roozbeh Mottaghi, Joseph C. Osborn, Julien Pérolat, Martin Schmid, Arash Shaban-Nejad, Onn Shehory, Biplav Srivastava, William W. Streilein, Kartik Talamadupula, Julian Togelius, Koichiro Yoshino, Quanshi Zhang, Imed Zitouni:
Reports of the Workshops Held at the 2019 AAAI Conference on Artificial Intelligence. AI Mag. 40(3): 67-78 (2019) - [j4]Neil Burch, Matej Moravcik, Martin Schmid:
Revisiting CFR+ and Alternating Updates. J. Artif. Intell. Res. 64: 429-443 (2019) - [c14]Martin Schmid, Neil Burch, Marc Lanctot, Matej Moravcik, Rudolf Kadlec, Michael Bowling:
Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games Using Baselines. AAAI 2019: 2157-2164 - [i8]Vojtech Kovarík, Martin Schmid, Neil Burch, Michael Bowling, Viliam Lisý:
Rethinking Formal Models of Partially Observable Multiagent Decision Making. CoRR abs/1906.11110 (2019) - [i7]Trevor Davis, Martin Schmid, Michael Bowling:
Low-Variance and Zero-Variance Baselines for Extensive-Form Games. CoRR abs/1907.09633 (2019) - 2018
- [c13]Neil Burch, Martin Schmid, Matej Moravcik, Dustin Morrill, Michael Bowling:
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. AAAI 2018: 949-956 - [i6]Martin Schmid, Neil Burch, Marc Lanctot, Matej Moravcik, Rudolf Kadlec, Michael Bowling:
Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines. CoRR abs/1809.03057 (2018) - [i5]Neil Burch, Matej Moravcik, Martin Schmid:
Revisiting CFR+ and Alternating Updates. CoRR abs/1810.11542 (2018) - 2017
- [c12]Neil Burch, Martin Schmid, Matej Moravcik, Michael Bowling:
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. AAAI Workshops 2017 - [i4]Matej Moravcík, Martin Schmid, Neil Burch, Viliam Lisý, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, Michael H. Bowling:
DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker. CoRR abs/1701.01724 (2017) - 2016
- [c11]Matej Moravcik, Martin Schmid, Karel Ha, Milan Hladík, Stephen J. Gaukrodger:
Refining Subgames in Large Imperfect Information Games. AAAI 2016: 572-578 - [c10]Rudolf Kadlec, Martin Schmid, Ondrej Bajgar, Jan Kleindienst:
Text Understanding with the Attention Sum Reader Network. ACL (1) 2016 - [i3]Rudolf Kadlec, Martin Schmid, Ondrej Bajgar, Jan Kleindienst:
Text Understanding with the Attention Sum Reader Network. CoRR abs/1603.01547 (2016) - [i2]Neil Burch, Martin Schmid, Matej Moravcik, Michael H. Bowling:
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. CoRR abs/1612.06915 (2016) - 2015
- [j3]Phuong Thuy Kim Doan, Julien Némery, Martin Schmid, Nicolas Gratiot:
Eutrophication of turbid tropical reservoirs: Scenarios of evolution of the reservoir of Cointzio, Mexico. Ecol. Informatics 29: 192-205 (2015) - [c9]Martin Schmid, Matej Moravcik, Milan Hladík, Stephen J. Gaukrodger:
Automatic Public State Space Abstraction in Imperfect Information Games. AAAI Workshop: Computer Poker and Imperfect Information 2015 - [i1]Rudolf Kadlec, Martin Schmid, Jan Kleindienst:
Improved Deep Learning Baselines for Ubuntu Corpus Dialogs. CoRR abs/1510.03753 (2015) - 2014
- [c8]Martin Schmid, Matej Moravcik, Milan Hladík:
Bounding the Support Size in Extensive Form Games with Imperfect Information. AAAI 2014: 784-790 - 2013
- [j2]Martin Schmid, Helga Prettenthaler, Christian Weger, Karl-Heinz Smolle:
Evaluation of a novel automated non-invasive pulse pressure variation algorithm. Comput. Biol. Medicine 43(10): 1583-1589 (2013) - [c7]Martin Schmid, Simon Berger, Gunther Reinhart:
Cognitive Parameter Adaption in Regular Control Structures - Using Process Knowledge for Parameter Adaption. ICINCO (1) 2013: 131-138 - [c6]Alexander Mense, Franz Hoheiser-Pförtner, Martin Schmid, Harald Wahl:
Concepts for a Standard based Cross-organisational Information Security Management System in the Context of a Nationwide EHR. MedInfo 2013: 548-552
2000 – 2009
- 2009
- [c5]Michael Thonhauser, Christian Kreiner, Martin Schmid:
Interpreting Model-Based Components for Information Systems. ECBS 2009: 254-261 - 2008
- [c4]Michael Eichhorn, Martin Schmid, Eckehard G. Steinbach:
A realtime streaming architecture for in-car multimedia: Design guidelines and prototypical implementation. ICVES 2008: 157-162 - 2004
- [j1]Bernhard Rinner, Martin Schmid, Reinhold Weiss:
A Rapid Prototyping Environment for Multi-DSP Systems based on Accurate Performance Prediction. J. Univers. Comput. Sci. 10(2): 110-134 (2004) - 2003
- [c3]Bernhard Rinner, Martin Schmid, Reinhold Weiss:
Rapid Prototyping of Flexible Embedded Systems on Multi-DSP Architectures. DATE 2003: 10204-10211 - 2001
- [c2]Bernhard Rinner, Bernd Ruprechter, Martin Schmid:
Rapid prototyping of multi-DSP systems based on accurate performance estimation. ICASSP 2001: 1113-1116 - 2000
- [c1]Claudia Mathis, Bernhard Rinner, Martin Schmid, Reinhard Schneider, Reinhold Weiss:
A new approach to model communication for mapping and scheduling DSP-applications. ICASSP 2000: 3354-3357
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-07-05 20:16 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:
