SoCS 2018: The International Symposium on Combinatorial Search Stockholm, Sweden, July 14-15, 2018 |
Conference website | https://sites.google.com/view/socs18/ |
Submission link | https://easychair.org/conferences/?conf=socs2018 |
Abstract registration deadline | May 6, 2018 |
Submission deadline | May 8, 2018 |
Heuristic search and other forms of combinatorial search are active areas of research in artificial intelligence, planning, robotics, constraint programming, operations research, bioinformatics, and other areas of computer science. SoCS is meant to bring researchers from these areas together to exchange their ideas and cross-fertilize the field.
Submission Guidelines
Submissions have to be made via EasyChair.
All submissions must be formatted in AAAI Style.
Accepted papers will be included in the SoCS proceedings.
We welcome the following kinds of submissions:
- Original Papers (Long or Short)
Original papers are technical papers that report on substantial research or position papers discussing ideas and concepts related to search. Long papers may be up to 8 pages in length, plus an additional page for references only. Short papers may be up to 4 pages, plus an additional page for references only. Long and short original papers should be new work which has not been published in (nor is currently simultaneously under review at) any other archival publication venue.
- Previously Published Papers
In order to foster the exchange of ideas at SoCS, we encourage authors to submit extended abstracts of papers describing new research which has been published in other venues in the last year. These abstracts may be up to 2 pages, plus an additional page for references only. The abstract should reference the original paper.
List of Topics
Topics of interest include but are not limited to the following:
- Analysis of search algorithms
- Automated synthesis of lower bounds
- Automatic algorithm selection and parameter tuning
- Bounding and pruning techniques
- Combinatorial puzzles
- Continuous problem solving
- External-memory and parallel search
- Incremental and active learning in search
- Meta-reasoning and search
- Methodology and critiques of current practice
- Model-based search
- Random versus systematic search strategy selection
- Portfolios of search algorithms
- Real-time search
- Search in goal-directed problem solving
- Search space discretization for continuous state-space problems
- Self-configuring and self-tuning algorithms
- Symmetry handling
- Time, memory, and solution quality trade-offs
- Search in big data
- Constraint search
- Search in robotics
- Search-based diagnosis
- Real-life applications
Committees
Program Committee
- TBA
Organizing committee
- Vadim Bulitko (co-chair)
- Sabine Storandt (co-chair)
Invited Speakers
- Robert C. Holte
- TBA
Venue
The conference will be held in Stockholm, Sweden.
Contact
bulitko@ualberta.ca
storandt@informatik.uni-wuerzburg.de