Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 193 matches
- 2024
- Michael Hartisch, Chu-Hsuan Hsueh, Jonathan Schaeffer:
Advances in Computer Games - 18th International Conference, ACG 2023, Virtual Event, November 28-30, 2023, Revised Selected Papers. Lecture Notes in Computer Science 14528, Springer 2024, ISBN 978-3-031-54967-0 [contents] - 2023
- Zeynep Burcu Kaya Alpan, Senol Piskin:
The Impact of Wind Simulation on Perceived Realism of Players. ACG 2023: 101-110 - Ingo Althöfer, Michael Hartisch, Thomas Zipproth:
Analysis of a Collatz Game and Other Variants of the 3n+1 Problem. ACG 2023: 123-132 - Daniel Barrish, Steve Kroon, Brink van der Merwe:
Making Superhuman AI More Human in Chess. ACG 2023: 3-14 - Cameron Browne:
Slitherlink Art. ACG 2023: 158-170 - Haoyu Du, Ting-Han Wei, Martin Müller:
Solving NoGo on Small Rectangular Boards. ACG 2023: 39-49 - Satoru Fujii:
Quantifying Feature Importance of Games and Strategies via Shapley Values. ACG 2023: 88-98 - Chu-Hsuan Hsueh, Kokolo Ikeda:
Can We Infer Move Sequences in Go from Stone Arrangements? ACG 2023: 76-87 - Maj Frost Jensen, Laurits Dixen, Paolo Burelli:
Hades Again and Again: A Study on Frustration Tolerance, Physiology and Player Experience. ACG 2023: 111-120 - James Ji, Michael Thielscher:
MCTS with Dynamic Depth Minimax. ACG 2023: 63-75 - Anei Makovec, Johanna Pirker, Matej Guid:
Merging Neural Networks with Traditional Evaluations in Crazyhouse. ACG 2023: 15-25 - Todd W. Neller, Quan H. Nguyen, Phong T. Pham, Linh T. Phan, Clifton G. M. Presser:
Optimal Play of the Great Rolled Ones Game. ACG 2023: 50-59 - Marc Pierre, Quentin Cohen-Solal, Tristan Cazenave:
The Mathematical Game. ACG 2023: 146-157 - Quazi Asif Sadmine, Asmaul Husna, Martin Müller:
Stockfish or Leela Chess Zero? A Comparison Against Endgame Tablebases. ACG 2023: 26-35 - Irfansha Shaik, Valentin Mayer-Eichberger, Jaco van de Pol, Abdallah Saffidine:
Implicit QBF Encodings for Positional Games. ACG 2023: 133-145 - 2022
- Cameron Browne, Akihiro Kishimoto, Jonathan Schaeffer:
Advances in Computer Games - 17th International Conference, ACG 2021, Virtual Event, November 23-25, 2021, Revised Selected Papers. Lecture Notes in Computer Science 13262, Springer 2022, ISBN 978-3-031-11487-8 [contents] - 2021
- Miha Bizjak, Matej Guid:
Automatic Recognition of Similar Chess Motifs. ACG 2021: 131-141 - Cameron Browne, Éric Piette, Matthew Stephenson, Dennis J. N. J. Soemers:
General Board Geometry. ACG 2021: 235-246 - Tristan Cazenave, Julien Sentuc, Mathurin Videau:
Cosine Annealing, Mixnet and Swish Activation for Computer Go. ACG 2021: 53-60 - Hung-Jui Chang, Cheng Yueh, Gang-Yu Fan, Ting-Yu Lin, Tsan-sheng Hsu:
Opponent Model Selection Using Deep Learning. ACG 2021: 176-186 - Boris Doux, Benjamin Négrevergne, Tristan Cazenave:
Deep Reinforcement Learning for Morpion Solitaire. ACG 2021: 14-26 - Nicolas Fabiano, Tristan Cazenave:
Sequential Halving Using Scores. ACG 2021: 41-52 - Keita Fujihira, Chu-Hsuan Hsueh, Kokolo Ikeda:
Procedural Maze Generation Considering Difficulty from Human Players' Perspectives. ACG 2021: 165-175 - Mark Goadrich, Collin Shaddox:
Quantifying the Space of Hearts Variants. ACG 2021: 247-256 - Dave Gomboc, Christian R. Shelton:
Chess Endgame Compression via Logic Minimization. ACG 2021: 153-162 - Gianluca Guglielmo, Irene Font Peradejordi, Michal Klincewicz:
Using Deep Learning to Detect Facial Markers of Complex Decision Making. ACG 2021: 187-196 - Mehmet Akif Gunes, Mehmet Fatih Kavum, Sanem Sariel:
A Generic Approach for Player Modeling Using Event-Trait Mapping Supported by PCA. ACG 2021: 197-207 - Rejwana Haque, Ting-Han Wei, Martin Müller:
On the Road to Perfection? Evaluating Leela Chess Zero Against Endgame Tablebases. ACG 2021: 142-152 - Ryan Hayward, Robert Hearn, Mahya Jamshidian:
BoxOff is NP-Complete. ACG 2021: 118-127 - Lucas Gnecco Heredia, Tristan Cazenave:
Expert Iteration for Risk. ACG 2021: 27-37
skipping 163 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-02 08:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint