Navigation


SoCS 2012


Related Conferences


Past SoCS Conferences
2011 Barcelona, Spain
2010 Atlanta, GA
2009 Lake Arrowhead, CA
2008 Chicago, IL


SoCS 2012: The Fifth Annual Symposium on Combinatorial Search

Speakers

We are pleased to have the following invited speakers at this year SoCS conference:

Invited Speakers



Tristan Cazenave
Talk Title: Single-agent Monte-Carlo Tree Search

Abstract:

Monte-Carlo methods have been applied with great success to two-player games such as Go. In this talk we focus on single-agent applications. A successful algorithm for single-agent Monte-Carlo tree search is Nested Monte-Carlo Search. It has been applied to puzzles such as Morpion Solitaire and SameGame and to difficult combinatorial optimization problems such as the Traveling Salesman with Time Windows. Nested Monte-Carlo Search can also be used to discover complex formulas in various domains. The algorithm will be presented as well as its applications and its developments.

About the Speaker:

Tristan Cazenave is professor of computer science at LAMSADE, Universite Paris-Dauphine. He holds a PhD from Universite Paris 6. His interests are in search algorithms and computer games. He has written programs for multiple board games and has authored more than one hundred scientific papers on artificial intelligence in games.


Stefan Edelkamp
Talk Title: Heuristic or Blind Search?

Abstract:

I will first open my and Stefan Schroedl's book on Heuristic Search. Starting with specialized solvers, I will show how general inputs can be solved efficiently. In the search I will employ lower bounds, perfect hash function, efficient priority queues and methods adopted from Machine Learning. I will also address symbolic representations and (SS & HD) disks to overcome limitations in RAM as well as parallel processes (on the CPU and GPU) to speed-up calculations. After closing the book, I will turn to recent surprises in optimal planning, where blind search could beat A* with state-of-the-art heuristics.

About the Speaker:

Stefan Edelkamp is a Professor in the Artificial Intelligence Group of the Faculty of Computer Science and Mathematics at the University of Bremen. He earned his Ph.D. from Freiburg University and has lead a junior research group at Technical University of Dortmund. His scientific interests are centered around Algorithmic Intelligence and include such areas as Heuristic Search, Action Planning, Game Playing, Machine Learning, Multi-Agent Simulation, Model Checking, External-Memory Algorithms, Parallel and Distributed Computing, Algorithm Engineering, Computational Biology, Decision Diagrams, Priority Queues, Navigation Systems, Network Security, and Intrusion Detection. Stefan Edelkamp has organized successful Workshops (e.g., MOCHART-06, SPIN-07), Conferences (e.g., KI-11, ICAPS-11) as well as Dagstuhl-Seminars (e.g., on Directed Model Checking and on Graph Search Engineering) and won several Performance Awards at International Planning Competitions. Together with Stefan Schroedl he is a co-author of the book "Heuristic Search - Theory and Applications" that has been recently published by Morgan Kaufmann / Elsevier Science.