CPSC532D Mini-Workshop "Stochastic Search Algorithms" 2003

CPSC532D Mini-Workshop "Stochastic Search Algorithms"

When?	Friday, April 25th, 9:30-17:30

Where?	Room 1613, Forest Sciences Centre

About the Event

This mini-workshop marks the end of CPSC 532D, a graduate course on stochastic search algorithms at the UBC Computer Science Department. The course covered a wide range of topics in the area of stochastic search methods and their applications; as one major component of their course work, students selected and worked on a project related to stochastic search algorithms and their applications in various areas in Computing Science. The results from these projects will be presented and discussed at this mini-workshop, which is intended to make this work accessible to a wider audience interested in stochastic search methods, and to give the students the chance of presenting their work in a format and under conditions which are close to the standards of the scientific community.

The technical talks will have a duration of 20-25min each, and after each talk there will be a 5-10min discussion period. The closing discussion is intended to involve all participants and will provide the opportunity to discuss general aspects of stochastic search methods and their applications, weaknesses of present approaches, approaches for future research, etc.

Schedule


9:30-9:45	Opening Remarks and Overview

9:45-10:30	Invited Talk:
	Iterated Robust Tabu Search for MAX-SAT (Kevin Smyth, UBC CS Dept)

10:45-11:45	Session 1:
	Embedding Balanced Binary Trees in the Hypercube (Markus Aderhold and James Slack)
	Motif-GRASP and Motif-ILS: Two New Stochastic Local Search Algorithms for Motif Finding (Mirela Andronescu and Baharak Rastegari)

12:00-13:00	Session 2:
	Stochastic Local Search Algorithms for Minimizing Edge Crossings in Complete Rectilinear Graphs (Maxwell Young, James Cook, and Ladan Mahabi)
	Solving the weighted Maximum Constraint Satisfaction Problem using Dynamic and Iterated Local Search (Diana Kapsa and Jacek Kisynski)

14:00-14:45	Invited Talk:
	Scaling and Probabilistic Smoothing for SAT and MAX-SAT (Dave Tompkins, UBC ECE Dept)

15:00-16:00	Session 3:
	Automatic Bounding Volume Hierarchy Generation Using Stochastic Search Methods (Kelvin Ng and Borislav Trifonov)
	Stochastic Local Search for BRDF Parameterization (Jonathan Backer, Fred Kimberley, and Iryna Skrypnyk)

16:15-17:00	Closing Remarks and Discussion

Organiser / Contact Information

Holger Hoos
University of British Columbia
Department of Computer Science
2366 Main Mall
Vancouver, BC, V6T 1Z4, Canada