„Game Programming“

Suchergebnisse

506 Treffer

• Equilibria for games with combined qualitative and quantitative objectives
  Gutierrez, Julian ; Murano, Aniello ; Perelli, Giuseppe ; Rubin, Sasha ; Steeples, Thomas ; Wooldridge, Michael J.
• Special Issue on AI in Games
  Risi, Sebastian ; Preuß, Mike
• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
  Bilò, Vittorio ; Flammini, Michele ; Monaco, Gianpiero ; Moscardelli, Luca
• Procedural Content Generation via Machine Learning – An Overview
  Guzdial, Matthew ; Snodgrass, Sam ; Summerville, Adam 2025 Springer Nature Switzerland, Imprint: Springer
• Teaching Programming Courses with Digital Educational Escape Rooms (DEER): A Conceptual Proposal Conducive to Learning by Trial and Error
  Trigo, António ; Antunes, Margarida 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Programming Language Embedded in Magic: The Gathering
  Yin, Howe Choong ; Churchill, Alex 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 10252 Executive Summary – Game Semantics and Program Verification
  Mellies, Paul-Andre ; Murawski, Andrzej S. ; Schalk, Andrea ; Walukiewicz, Igor
• 10252 Abstracts Collection – Game Semantics and Program Verification
  Mellies, Paul-Andre ; Murawski, Andrzej S. ; Schalk, Andrea ; Walukiewicz, Igor
• General Logic Programs as Infinite Games
  Galanaki, Chrysida ; Rondogiannis, Panos ; Wadge, William W.
• The Dungeon Variations Problem Using Constraint Programming
  Glorian, Gaël ; Debesson, Adrien ; Yvon-Paliot, Sylvain ; Simon, Laurent 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• $$H^\infty $$ H ∞ -Optimal Control via Game-Theoretic Differential Dynamic Programming and Gaussian Processes
  Sun, Wei ; Trafalis, Theodore B.
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder
  Austrin, Per ; Stanković, Aleksa 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The RGB No-Signalling Game
  Coiteux-Roy, Xavier ; Crépeau, Claude 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Reachability for Branching Concurrent Stochastic Games (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Etessami, Kousha ; Martinov, Emanuel ; Stewart, Alistair ; Yannakakis, Mihalis 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Dorfman, Dani ; Kaplan, Haim ; Zwick, Uri 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bounding Quantum-Classical Separations for Classes of Nonlocal Games
  Bannink, Tom ; Briët, Jop ; Buhrman, Harry ; Labib, Farrokh ; Lee, Troy 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Game Efficiency Through Linear Programming Duality
  Kim Thang, Nguyen 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fully Abstract Models of the Probabilistic lambda-calculus
  Clairambault, Pierre ; Paquet, Hugo 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Study of a Combinatorial Game in Graphs Through Linear Programming
  Cohen, Nathann ; Mc Inerney, Fionn ; Nisse, Nicolas ; Pérennes, Stéphane 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating Unique Games Using Low Diameter Graph Decomposition
  Levi Alev, Vedat ; Lau, Lap Chi 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik