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

• 2011
• 
  Vidal Alcázar, Manuela M. Veloso, Daniel Borrajo:
  Adapting a Rapidly-Exploring Random Tree for Automated Planning. SOCS 2011: 2-9
• 
  Christer Bäckström, Peter Jonsson:
  All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. SOCS 2011: 10-17
• 
  Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer:
  Degrees of Separation in Social Networks. SOCS 2011: 18-23
• 
  Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony:
  Repeated-Task Canadian Traveler Problem. SOCS 2011: 24-30
• 
  Neil Burch, Robert C. Holte:
  Automatic Move Pruning in General Single-Player Games. SOCS 2011: 31-38
• 
  Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml:
  Deadline-Aware Search Using On-Line Measures of Behavior. SOCS 2011: 39-46
• 
  Achiya Elyasaf, Yael Zaritsky, Ami Hauptman, Moshe Sipper:
  Evolving Solvers for FreeCell and the Sliding-Tile Puzzle. SOCS 2011: 189-190
• 
  Ariel Felner:
  Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. SOCS 2011: 47-51
• 
  Kalin Gochev, Benjamin J. Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev:
  Path Planning with Adaptive Dimensionality. SOCS 2011: 52-59
• 
  Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer:
  The Compressed Differential Heuristic. SOCS 2011: 191-192
• 
  Juan Pablo Gonzalez, Maxim Likhachev:
  Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces. SOCS 2011: 60-67
• 
  Carlos Hernández, Jorge A. Baier:
  Real-Time Adaptive A* with Depression Avoidance. SOCS 2011: 193-194
• 
  Eric Huang, Richard E. Korf:
  Optimal Packing of High-Precision Rectangles. SOCS 2011: 195-196
• 
  Tatsuya Imai, Akihiro Kishimoto:
  A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. SOCS 2011: 197-198
• 
  Morteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati:
  A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems. SOCS 2011: 68-75
• 
  Mokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant:
  A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding. SOCS 2011: 76-83
• 
  Lars Kotthoff, Ian P. Gent, Ian Miguel:
  A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems. SOCS 2011: 84-91
• 
  Aleksandr Kushleyev, Brian MacAllister, Maxim Likhachev:
  Planning for Landing Site Selection in the Aerial Supply Delivery. SOCS 2011: 199-200
• 
  Michael J. Leighton, Wheeler Ruml, Robert C. Holte:
  Faster Optimal and Suboptimal Hierarchical Search. SOCS 2011: 92-99
• 
  Levi Lelis, Roni Stern, Shahab Jabbari Arfaee:
  Predicting Solution Cost with Conditional Probabilities. SOCS 2011: 100-107
• 
  Levi Lelis, Sandra Zilles, Robert C. Holte:
  Improved Prediction of IDA*'s Performance via Epsilon-Truncation. SOCS 2011: 108-116
• 
  Ryan Luna, Kostas E. Bekris:
  Efficient and Complete Centralized Multi-Robot Path Planning. SOCS 2011: 201-202
• 
  Lars Otten, Rina Dechter:
  Anytime AND/OR Depth-First Search for Combinatorial Optimization. SOCS 2011: 117-124
• 
  Bo Pang, Robert C. Holte:
  State-Set Search. SOCS 2011: 125-133
• 
  Mike Phillips, Maxim Likhachev:
  Planning in Domains with Cost Function Dependent Actions. SOCS 2011: 203-204
• 
  Mihail Pivtoraiko, Alonzo Kelly:
  Graduated Fidelity Motion Planning. SOCS 2011: 205-206
• 
  Álvaro Torralba Arias de Reyna, Carlos Linares López:
  Size-Independent Additive Pattern Databases for the Pancake Problem. SOCS 2011: 164-171
• 
  Kevin Rose, Ethan Burns, Wheeler Ruml:
  Best-First Search for Bounded-Depth Trees. SOCS 2011: 134-141
• 
  Tim Schmidt, Rong Zhou:
  Representing Pattern Databases with Succinct Data Structures. SOCS 2011: 142-149
• 
  Guni Sharon, Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
  Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding. SOCS 2011: 150-157

skipping 7 more matches