The Symposium on Combinatorial Search

Authors:
Daniel Borrajo;Maxim Likhachev;Carlos Linares López
Affiliations:
Computer Science Department, Universidad Carlos III de Madrid, Madrid, Spain. E-mails: dborrajo@ia.uc3m.es, carlos.linares@uc3m.es;Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA. E-mail: maxim@cs.cmu.edu;(Correspd. E-mail: carlos.linares@uc3m.es) Computer Science Department, Universidad Carlos III de Madrid, Madrid, Spain. E-mails: dborrajo@ia.uc3m.es, carlos.linares@uc3m.es
Venue:
AI Communications - The Symposium on Combinatorial Search
Year:
2012

Citing 3
Cited 0

Anytime AND/OR depth-first search for combinatorial optimization

AI Communications - The Symposium on Combinatorial Search
Finding patterns in an unknown graph

AI Communications - The Symposium on Combinatorial Search
An evaluation of machine learning in algorithm selection for search problems

AI Communications - The Symposium on Combinatorial Search

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of the Symposium on Combinatorial Search (SoCS) is to promote the study and understanding of combinatorial search algorithms through the organization of scientific meetings, publications, tutorials, and other public scientific and educational activities. The most prominent among its activities is the annual Symposium on Combinatorial Search that has been organized regularly since 2008 as a result of the success of other scientific meetings, typically workshops co-located with high-level Artificial Intelligence conferences (AAAI and IJCAI). This paper reviews the history of the Symposium making emphasis on the last edition that was held in July 2011 in Barcelona (Spain).