Thursday, July 8
6:30 PM	Opening Banquet
Friday, July 9
7:30 - 8:45	Breakfast
8:45 - 9:00	Welcome and Opening Remarks
9:00 - 10:00	Invited Talk: Dorothea Wagner
10:00 - 10:30	Coffee Break
10:30 - 11:30	Paper Session #1: Heuristics Chair: Maxim Likhachev (Details)
	Bootstrap Learning of Heuristic Functions Shahab Jabbari, Sandra Zilles and Robert C. Holte
	Additive Heuristic for Four-Connected Gridworlds Kenneth Anderson
	Portal-Based True-Distance Heuristics for Path Finding Meir Goldenberg, Ariel Felner, Nathan Sturtevant and Jonathan Schaeffer
11:30 - 11:35	Stretch Break
11:35 - 12:00	Position Talks Chair: Malte Helmert (Details)
	Cost-based Search Considered Harmful William Cushing, J. Benton and Subbarao Kambhampati
	Benchmark Problem Sizes Wheeler Ruml
12:00 - 12:05	Stretch Break
12:05 - 12:30	Poster Introductions I (Details)
	Potential search: a greedy anytime heuristic search Roni Stern, Rami Puzis and Ariel Felner
	Anytime Heuristic Search: Frameworks and Algorithms Jordan Thayer and Wheeler Ruml
	Computing Equivalent Transformations for Applying Branch-and-Bound Search to MaxSAT Eric Hsu and Sheila McIlraith
	A Comparison of Greedy Search Algorithms Christopher Wilt, Jordan Thayer and Wheeler Ruml
	Landmark Heuristics for the Pancake Problem Malte Helmert
	Edge Partitioning in Parallel Structured Duplicate Detection Rong Zhou, Tim Schmidt, Eric Hansen, Minh Do and Serdar Uckun
	Search Space Reduction Using Swamp Hierarchies Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein and Ariel Felner
	Single-Frontier Bidirectional Search Carsten Moldenhauer, Ariel Felner, Nathan Sturtevant and Jonathan Schaeffer
	Any-Angle Path Planning and Path Length Analysis in 3D Alex Nash, Sven Koenig and Craig Tovey
12:30 - 2:00	Lunch
2:00 - 3:00	Paper Session #2: Search Applications Chair: Alex Fukanaga (Details)
	Improved Multi-Way Number Partitioning Richard Korf
	Searching for a k-Clique in Unknown Graphs Roni Stern, Meir Kalech and Ariel Felner
	Directed Plateau Search for MAX-k-SAT Andrew M. Sutton, Adele E. Howe and L. Darrell Whitley
3:00 - 3:30	Coffee Break
3:30 - 4:30	Paper Session #3: Planning Chair: Vincent Vidal (Details)
	Improving Local Search for Resource-Constrained Planning Hootan Nakhost, Jorg Hoffmann and Martin Mueller
	Adding Diversity to Classical Heuristic Planning Carlos Linares Lopez and Daniel Borrajo
	On Transposition Tables for Single-Agent Search and Planning: Summary of Results Yuima Akagi, Akihiro Kishimoto and Alex Fukunaga
4:30 - 4:45	Stretch Break
4:45 - 5:45	Panel Session: Planning and Search Chair: Wheeler Ruml
5:45 - 7:00	Dinner
6:30 / 7:00	Busses to Stone Mountain (Outing)
Saturday, July 10
7:30 - 8:55	Breakfast
8:55 - 9:00	Welcome and Opening Remarks
9:00 - 10:00	Invited Talk: Sven Koenig
10:00 - 10:30	Coffee Break
10:30 - 11:30	Paper Session #4: Search Algorithms I Chair: Robert Holte (Details)
	On the Scaling Behavior of HDA* Akihiro Kishimoto, Alex Fukunaga and Adi Botea
	Parallel, Dynamic K-Best-First Search Vincent Vidal, Lucas Bordeaux and Youssef Hamadi
	Heuristic Contraction Hierarchies with Approximation Guarantee Robert Geisberger and Dennis Schieferdecker
11:30 - 11:35	Stretch Break
11:35 - 12:15	Paper Session #5: Search Algorithms II Chair: Rong Zhou (Details)
	Finding Acceptable Solutions Faster Using Inadmissible Information Jordan Thayer and Wheeler Ruml
	Real-Time Search in Dynamic Worlds David M. Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun and Sven Koenig
12:15 - 12:30	Poster Introductions II (Details)
	High-Quality Policies for the Canadian Traveler's Problem Patrick Eyerich, Thomas Keller and Malte Helmert
	Search-based Planning for Manipulation with Motion Primitives Benjamin Cohen, Sachin Chitta and Maxim Likhachev
	Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms Richard Valenzano, Nathan Sturtevant, Jonathan Schaeffer, Karen Buro and Akihiro Kishimoto
	Search-based Path Planning with Homotopy Class Constraints Subhrajit Bhattacharya, Vijay Kumar and Maxim Likhachev
	GP-Rush: Using Genetic Programming to Evolve Solvers for the Rush Hour Puzzle Ami Hauptman, Achiya Elyasaf, Moshe Sipper and Assaf Karmon
12:30 - 2:00	Lunch
2:00 - 2:40	Paper Session #6: Two-Player Games Chair: Carlos Linares Lopez (Details)
	Layer-Abstraction for Symbolically Solving General Two-Player Games Peter Kissmann and Stefan Edelkamp
	GPU Exploration of Two-Player Games with Perfect Hash Functions Stefan Edelkamp and Damian Sulewski
2:40 - 3:00	Coffee Break / Poster Setup
3:00 - 5:00	Poster Session 14 posters (Details)
	Potential search: a greedy anytime heuristic search Roni Stern, Rami Puzis and Ariel Felner
	Anytime Heuristic Search: Frameworks and Algorithms Jordan Thayer and Wheeler Ruml
	Computing Equivalent Transformations for Applying Branch-and-Bound Search to MaxSAT Eric Hsu and Sheila McIlraith
	A Comparison of Greedy Search Algorithms Christopher Wilt, Jordan Thayer and Wheeler Ruml
	Landmark Heuristics for the Pancake Problem Malte Helmert
	Edge Partitioning in Parallel Structured Duplicate Detection Rong Zhou, Tim Schmidt, Eric Hansen, Minh Do and Serdar Uckun
	Search Space Reduction Using Swamp Hierarchies Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein and Ariel Felner
	Single-Frontier Bidirectional Search Carsten Moldenhauer, Ariel Felner, Nathan Sturtevant and Jonathan Schaeffer
	Any-Angle Path Planning and Path Length Analysis in 3D Alex Nash, Sven Koenig and Craig Tovey
	High-Quality Policies for the Canadian Traveler's Problem Patrick Eyerich, Thomas Keller and Malte Helmert
	Search-based Planning for Manipulation with Motion Primitives Benjamin Cohen, Sachin Chitta and Maxim Likhachev
	Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms Richard Valenzano, Nathan Sturtevant, Jonathan Schaeffer, Karen Buro and Akihiro Kishimoto
	Search-based Path Planning with Homotopy Class Constraints Subhrajit Bhattacharya, Vijay Kumar and Maxim Likhachev
	GP-Rush: Using Genetic Programming to Evolve Solvers for the Rush Hour Puzzle Ami Hauptman, Achiya Elyasaf, Moshe Sipper and Assaf Karmon
5:00 - 6:00	Closing Meeting
6:00 - 7:30	Dinner
7:30	Bus to AAAI