IJCAI-03 Workshop on Stochastic Search Algorithms

Programme Overview

Monday, August 11, 2003

• 9:00-12:30 morning sessions [coffee break 10:30-11:00]
• 12:30-14:00: lunch break
• 14:00-17:30: afternoon sessions [coffee break: 15:30-16:00]
• 19:00-??: informal workshop dinner

Detailed Programme

Monday, August 11, 2003

9:00 Introduction and Overview

9:30-10:30 Invited Talk

• Weixiong Zhang:
  Phase Transitions, Backbones, and Heuristic Search Algorithms

[ 10:30-11:00 Coffee Break ]

11:00-12:30 Paper Session 1

• N. Lesh, J. Marks, A. McMahon, and M. Mitzenmacher:
  New Heuristic and Interactive Approaches to 2D Rectangular Strip Packing
• Y. Ruan, E. Horvitz, and H. Kautz:
  Hardness-Aware Restart Policies
• H. Zou and B. Y. Choueiry:
  Multi-agent Based Search versus Local Search and Backtrack Search for Solving Tight CSPs: A Practical Case Study

[ 12:30-14:00 Lunch Break ]

14:00-15:00 Paper Session 2

• A. S. Fukunaga:
  Complete Restart Strategies Using a Compact Representation of the Explored Search Space
• M. A. Salido and F. Barbery:
  Stochastic Local Search for Distributed Constraint Satisfaction Problems
• J. Denzinger and K. Randall:
  Enhancing Tree-based (Stochastic) Search by Learning from Previous Experience

[15:00-15:20 Short Break]

15:20-16:00 Paper Session 3

• A. M. Abdelbar and S. Abdel-Shahid:
  A Modified Particle Swarm Algorithm Applied to Weighted Max-Sat
• S. Boettcher and A. G. Percus:
  Extremal Optimization: an Evolutionary Local-Search Algorithm

[ 16:00-16:30 Coffee Break ]

16:30-17:15 Panel: Future Directions in Stochastic Search

17:15-17:30 Closing Remarks

[19:00-?? Informal Workshop Dinner]

Information for Presenters