• 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.

found 21 matches

• 2010
• 
  H. Jaap van den Herik, Pieter Spronck:
  Advances in Computer Games, 12th International Conference, ACG 2009, Pamplona, Spain, May 11-13, 2009. Revised Papers. Lecture Notes in Computer Science 6048, Springer 2010, ISBN 978-3-642-12992-6 [contents]
• 2009
• 
  Eiko Bleicher, Guy Haworth:
  6-Man Chess and Zugzwangs. ACG 2009: 123-135
• 
  Tristan Cazenave:
  Monte-Carlo Kakuro. ACG 2009: 45-54
• 
  Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud:
  Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. ACG 2009: 1-13
• 
  Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu:
  Conflict Resolution of Chinese Chess Endgame Knowledge Base. ACG 2009: 146-157
• 
  Sheng-Hao Chiang, I-Chen Wu, Ping-Hung Lin:
  On Drawn K-In-A-Row Games. ACG 2009: 158-169
• 
  Paolo Ciancarini, Gian Piero Favini:
  Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K. ACG 2009: 136-145
• 
  Markus Enzenberger, Martin Müller:
  A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. ACG 2009: 14-20
• 
  Matej Guid, Martin Mozina, Aleksander Sadikov, Ivan Bratko:
  Deriving Concepts and Strategies from Chess Tablebases. ACG 2009: 195-207
• 
  Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta:
  Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. ACG 2009: 99-110
• 
  Philip Henderson, Broderick Arneson, Ryan B. Hayward:
  Hex, Braids, the Crossing Rule, and XH-Search. ACG 2009: 88-98
• 
  Li-Te Huang, Shun-Shii Lin:
  Optimal Analyses for 3×n AB Games in the Worst Case. ACG 2009: 170-181
• 
  Joe Hurd, Guy Haworth:
  Data Assurance in Opaque Computations. ACG 2009: 221-231
• 
  Giel van Lankveld, Pieter Spronck, H. Jaap van den Herik, Matthias Rauterberg:
  Incongruity-Based Adaptive Game Balancing. ACG 2009: 208-220
• 
  Jahn-Takeshi Saito, Mark H. M. Winands, H. Jaap van den Herik:
  Randomized Parallel Proof-Number Search. ACG 2009: 75-87
• 
  Pálmi Skowronski, Yngvi Björnsson, Mark H. M. Winands:
  Automated Discovery of Search-Extension Features. ACG 2009: 182-194
• 
  Istvan Szita, Guillaume Chaslot, Pieter Spronck:
  Monte-Carlo Tree Search in Settlers of Catan. ACG 2009: 21-32
• 
  Fabien Teytaud, Olivier Teytaud:
  Creating an Upper-Confidence-Tree Program for Havannah. ACG 2009: 65-74
• 
  David Tom, Martin Müller:
  A Study of UCT and Its Enhancements in an Artificial Game. ACG 2009: 55-64
• 
  Gerhard Trippen:
  Plans, Patterns, and Move Categories Guiding a Highly Selective Search. ACG 2009: 111-122
• 
  Mark H. M. Winands, Yngvi Björnsson:
  Evaluation Function Based Monte-Carlo LOA. ACG 2009: 33-44