May 23, 2012 Comments Off on Schedule
Schedule
All the technical sessions take place in Research Wing.
May 27th (Sunday)
15:00 ? Hotel Check In (early check-in from 12:00 is negotiable if informed in advance)
19:00 ? 21:00: Welcome Reception (Room “Azalea”, 1F)
May 28th (Monday)
7:30 ? 9:00: Breakfast (Oak room)
9:45 ? 10:00: Welcome and Introduction
10:00 ? 12:00: General discussion, organization of the sessions
12:00 ? 13:30: Lunch (Oak room)
13:30 ? 18:00: Afternoon Session
- Resource Allocation for Memory Intensive Parallel Search Algorithms (Long)
Alex Fukunaga - Two open problems in Parallel Consistency (Short)
Arnaud Lallouet - Parallel Restarted Search and Parallel Dichotomic Search (Long)
Meinolf Sellmann - Search Combinators for Parallel Search (Long)
Guido Tack - Can GPU Speed Up Search in Constraint Satisfaction (Short)
Jimmy Lee - Local Search and Propagation on Hierarchical Multiprocessors (Long)
Salvador Abreu - Wave Search (Long)
Philippe Codognet - Optimization challenges in the implementation of deployment strategies for protected long-reach PON (Long)
Luis Quesada
18:00 ? 19:30: Dinner (Oak room)
19:30 ? Free Time
May 29th (Tuesday)
7:30 ? 9:00: Breakfast (Oak room)
9:00 ? 12:00: Morning Session
- Parallel Constraint-Based Local Search (Short)
Yves Caniou - Parallel local search for the Costas Array Problem (Long)
Florian Richoux - Probabilistic Study of Random Restart (Long)
Charlotte Truchet - Parallel Local Search: experiments with a different programming model (Short)
Rui Machado - On Parameterized Multiroute Flows: A tool to manage failures in a network (Long)
Jean-Francois Baffier - How the declarative multi-threaded implementation of some combinatorial algorithms turned into a garbage collection nightmare (Short)
Bart Demoen
12:00 ? 13:30: Lunch (Oak room)
13:30 ? 18:00: Excursion (Tokenji Temple and Engakuji Temple ?in North Kamakura)
18:00 ? 20:00: Banquet (Restaurant Hachinoki in North Kamakura)
May 30th (Wednesday)
7:30 ? 9:00: Breakfast (Oak room)
9:00 ? 12:00: Morning Session (Group Photo at 10:00)
- Symbolic Execution for Combinatorial Problems (Long)
Joxan Jaffar - SatX10: An architecture for Capability Constraint Solving in X10 (Long)
Vijay Saraswat - Parallel Local Search for SAT (Long)
Alejandro Arbelaez - CSPSAT and Beyond (Short) (auxiliary slides)
Katsumi Inoue - A compact and efficient SAT encoding of CSP and its evaluation (Short)
Tomoya Tanjo - Applying Incremental SAT Solving to Optimization and Enumeration Problems (Short)
Takehide Soh
12:00 ? 13:30: Lunch (Oak room)
13:30 ? 18:00: Afternoon Session
- Development of the LMNtal Parallel Model Checker (Long)
Kazunori Ueda - Parallel algebraic computations for combinatorial problems (Long)
Yosuke Sato - Speculative Computation (Short)
Ken Satoh - High-performance Distributed Computing for Optimization Problems (Short)
Kento Aida - Combinatorial Optimization using Binary Decision Diagrams (Short)
Hiroyuki Higuchi - Exploring the Power of Soft Constraints (Short)
Hiroshi Hosobe - Between Optimization and Enumeration (Long)
Takeaki UNO - Constraints and Big Data? (Long)
Roland Yap
18:00 ? 19:30: Dinner (Oak room)
19:30 ? Free Time
May 31st? (Thursday)
7:30 ? 9:00: Breakfast (Oak room)
9:00 ? 10:00: Hotel Check Out
10:00 ? 12:00: Wrap-up session & Closing
12:00 ? 13:30: Lunch (Oak room)