Остановите войну!
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 22 matches
- 2010
- Ingo Althöfer:
Automatic Generation and Evaluation of Recombination Games. J. Int. Comput. Games Assoc. 33(4): 215-216 (2010) - Eiko Bleicher, Guy McCrossan Haworth, Harold M. J. F. van der Heijden:
Data-Mining Chess Databases. J. Int. Comput. Games Assoc. 33(4): 212-214 (2010) - B.-N. Chen, B.-J. Shen, T.-S. Hsu:
Chinese Dark Chess. J. Int. Comput. Games Assoc. 33(2): 93-106 (2010) - Omid David-Tabibi, Moshe Koppel, Nathan S. Netanyahu:
Genetic Algorithms for Automatic Search Tuning. J. Int. Comput. Games Assoc. 33(2): 67-79 (2010) - Maarten van Emden, André Vellino:
From Chinese Room to Human Window. J. Int. Comput. Games Assoc. 33(3): 127-139 (2010) - Dap Hartmann:
Omid David-Tabibi: Mimicking the Black Box. J. Int. Comput. Games Assoc. 33(1): 42-43 (2010) - Dap Hartmann:
Human Superiority Restored. J. Int. Comput. Games Assoc. 33(3): 150-151 (2010) - Dap Hartmann:
How Can Humans Learn from Computers? J. Int. Comput. Games Assoc. 33(4): 217-218 (2010) - G. McC. Haworth:
Chess Endgame Knowledge Advances. J. Int. Comput. Games Assoc. 33(3): 149 (2010) - H. Jaap van den Herik:
Stonehenge Solved. J. Int. Comput. Games Assoc. 33(1): 1 (2010) - H. Jaap van den Herik:
Welcome to the New Deputy Editor. J. Int. Comput. Games Assoc. 33(1): 2 (2010) - H. Jaap van den Herik:
The Drosophila Revisited. J. Int. Comput. Games Assoc. 33(2): 65-66 (2010) - H. Jaap van den Herik:
Farewell to the Turing Test? J. Int. Comput. Games Assoc. 33(3): 125-126 (2010) - H. Jaap van den Herik:
A Change to Aesthetics. J. Int. Comput. Games Assoc. 33(4): 189 (2010) - H. Jaap van den Herik:
Change of Email Addresses. J. Int. Comput. Games Assoc. 33(4): 189 (2010) - Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin:
Monte-Carlo Simulation Balancing Applied to 9x9 Go. J. Int. Comput. Games Assoc. 33(4): 191-201 (2010) - Azlan Iqbal:
Aesthetics in Mate-in-3 Combinations (Part I: Combinatorics and Weights). J. Int. Comput. Games Assoc. 33(3): 140-148 (2010) - Azlan Iqbal:
Aesthetics in Mate-in-3 Combinations (Part II: Normality). J. Int. Comput. Games Assoc. 33(4): 202-211 (2010) - Fritz Reul:
Static Exchange Evaluation with αβ-Approach. J. Int. Comput. Games Assoc. 33(1): 3-17 (2010) - Yoshikuni Sato, Daisuke Takahashi, Reijer Grimbergen:
A Shogi Program Based on Monte-Carlo Tree Search. J. Int. Comput. Games Assoc. 33(2): 80-92 (2010) - Yasuhiko Takenaga, Hikari Mori, Shigeki Iwata:
Stonehenge: Outcome of All First Moves and PSPACE-Completeness. J. Int. Comput. Games Assoc. 33(1): 34-41 (2010) - Jiao Wang, Si-Zhong Li, Xinhe Xu:
A Minors Hash Table in Chinese-Chess Programs. J. Int. Comput. Games Assoc. 33(1): 18-33 (2010)
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-23 19: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