• 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 29 matches

• 2016
• 
  Scott Alfeld, Xiaojin Zhu, Paul Barford:
  Machine Teaching as Search. SOCS 2016: 117-118
• 
  Yusra Alkhazraji, Martin Wehrle:
  Sleep Sets Meet Duplicate Elimination. SOCS 2016: 2-9
• 
  Bruno Bouzy:
  Burnt Pancake Problem: New Lower Bounds on the Diameter and New Experimental Optimality Ratios. SOCS 2016: 119-120
• 
  Vadim Bulitko:
  Searching for Real-Time Heuristic Search Algorithms. SOCS 2016: 121-122
• 
  Vadim Bulitko, Alexander Sampley:
  Weighted Lateral Learning in Real-Time Heuristic Search. SOCS 2016: 10-18
• 
  Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati:
  Compliant Conditions for Polynomial Time Approximation of Operator Counts. SOCS 2016: 123-124
• 
  Wenxiang Chen, L. Darrell Whitley, Adele E. Howe, Brian W. Goldman:
  Stochastic Local Search over Minterms on Structured SAT Instances. SOCS 2016: 125-126
• 
  Laura Climent, Barry O'Sullivan, Richard J. Wallace:
  An Improved Metaheuristic Algorithm for Maximizing Demand Satisfaction in the Population Harvest Cutting Stock Problem. SOCS 2016: 127-128
• 
  David A. Cohen, Christopher Jefferson, Karen E. Petrie:
  A Theoretical Framework for Constraint Propagator Triggering. SOCS 2016: 19-27
• 
  Skylar R. Croy, Jeremy A. Hansen, Daniel J. McQuillan:
  Calculating the Number of Order-6 Magic Squares with Modular Lifting. SOCS 2016: 129-130
• 
  Bence Cserna, Mike Bogochow, Stephen Chambers, Michaela Tremblay, Sammie Katt, Wheeler Ruml:
  Anytime versus Real-Time Heuristic Search for On-Line Planning. SOCS 2016: 131-132
• 
  Stefan Funke, Sabine Storandt:
  Consistent Rounding of Edge Weights in Graphs. SOCS 2016: 28-35
• 
  Daniel Gilon, Ariel Felner, Roni Stern:
  Dynamic Potential Search - A New Bounded Suboptimal Search. SOCS 2016: 36-44
• 
  Daniel Gnad, Marcel Steinmetz, Mathäus Jany, Jörg Hoffmann, Ivan Serina, Alfonso Gerevini:
  Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications. SOCS 2016: 45-53
• 
  Leon Illanes, Sheila A. McIlraith:
  Numeric Planning via Search Space Abstraction (Extended Abstract). SOCS 2016: 133-134
• 
  Péter Karkus, Glenn Wagner, Howie Choset:
  Recursive Constraint Manifold Subsearch for Multirobot Path Planning with Cooperative Tasks. SOCS 2016: 54-62
• 
  Levi H. S. Lelis, Richard Anthony Valenzano, Gabriel L. Nazar, Roni Stern:
  Searching with a Corrupted Heuristic. SOCS 2016: 63-71
• 
  Ciaran McCreesh, Patrick Prosser:
  Finding Maximum k-Cliques Faster Using Lazy Global Domination. SOCS 2016: 72-80
• 
  Gerald Paul, Malte Helmert:
  Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis. SOCS 2016: 135-136
• 
  Tim Schulte, Bernhard Nebel:
  Trial-Based Heuristic Tree-search for Distributed Multi-Agent Planning. SOCS 2016: 137-138
• 
  Vitali Sepetnitsky, Ariel Felner, Roni Stern:
  Repair Policies for Not Reopening Nodes in Different Search Settings. SOCS 2016: 81-88
• 
  Guni Sharon, Robert C. Holte, Ariel Felner, Nathan R. Sturtevant:
  Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search. SOCS 2016: 139-140
• 
  Hilla Shinitzky, Roni Tzvi Stern, Meir Kalech:
  Batch Repair with Heuristic Search. SOCS 2016: 141-142
• 
  Ben Stephenson:
  A Multi-Phase Search Approach to the LEGO Construction Problem. SOCS 2016: 89-97
• 
  Nathan R. Sturtevant:
  Generalizing JPS Symmetry Detection: Canonical Orderings on Graphs. SOCS 2016: 143-144
• 
  Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
  An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. SOCS 2016: 145-146
• 
  Tony T. Tran, Minh Do, Eleanor Gilbert Rieffel, Jeremy Frank, Zhihui Wang, Bryan O'Gorman, Davide Venturelli, J. Christopher Beck:
  A Hybrid Quantum-Classical Approach to Solving Scheduling Problems. SOCS 2016: 98-106
• 
  Anirudh Vemula, Katharina Mülling, Jean Oh:
  Path Planning in Dynamic Environments with Adaptive Dimensionality. SOCS 2016: 107-115
• 
  Jorge A. Baier, Adi Botea:
  Proceedings of the Ninth Annual Symposium on Combinatorial Search, SOCS 2016, Tarrytown, NY, USA, July 6-8, 2016. AAAI Press 2016, ISBN 978-1-57735-769-8 [contents]