| Title: | Visualizing Local Search |
| Date: |
December 14, 2006 (Thursday)
|
| Time: |
2:30 p.m. - 3:30 p.m.
|
| Venue: |
Room 1027, 10/F, Ho Sin-hang Engineering Building,
The Chinese University of Hong Kong, Shatin, N.T. |
| Speaker: |
Professor Roland Yap
Department of Computer Science National University of Singapore Singapore |
Local search algorithms are often the method of choice for solving intractable NP-hard combinatorial problems. Since local search algorithms are based on meta-heuristics, it can be hard to understand how to improve or tune them. We present a visualization approach which uses animation to present the behavior of local search. We combine several visualizations including a novel one on search trajectories which can be used as a generic visualization for local search algorithms. We also show how animation can be used to compare different algorithms or settings of meta-heuristics. We will also present the design of the user interface which makes use of a variety of HCI and graphical techniques to reduce visual clutter and convey more information in an intuitive fashion.
BIOGRAPHY:
Roland Yap is an associate professor at the Department of Computer Science, National University of Singapore. He is one of the primary authors of the CLP(R) system which was the first CLP language with arithmetic constraints. His current research interests are in the area of constraints, programming languages, bioinformatics, distributed systems and systems security. He obtained his B.Sc and Ph.D from Monash University, Australia.
Enquiries: Miss Temmy So at tel 2609 8444
For more information, please refer to http://www.cse.cuhk.edu.hk/seminar