LSCS is an annual workshop, since 2004, devoted to local search techniques in constraint satisfaction. This workshop focuses on all aspects of local search techniques, including: design and implementation of new algorithms, hybrid stochastic-systematic search, reactive and adaptive search, modeling for local-search, global constraints, flexibility and robustness, learning methods, and specific applications. The workshop will provide an informal environment for discussions about recent results in these and related areas. Papers are solicited from the above areas or from any other area related to local search in constraint satisfaction. In addition to contributed papers, we will have one invited lecture and will also provide opportunities for short presentations of post-deadline important results.
Authors should prepare their full papers in the LNCS/LNAI format, by following Springer instructions. The maximum is 15 pages. Extended abstracts of post-deadline important results should be no longer than two pages, including figures and references. Papers and abstracts submitted to the workshop will be reviewed by at least two members of the program committee. Decisions about acceptance or rejection will be made considering both the merit of the paper and the available time for presentations. At least one author of each accepted submission must attend the workshop. Papers should be submitted with EasyChair (address coming).
|Submission deadline:||13 July 2009|
|Notifications:||5 August 2009|
|Camera-ready deadline:||25 August 2009|
|Workshop:||20 September 2009|
At least one author of an accepted submission must attend the workshop. The workshop will be open to all members of the CP community. All workshop participants must pay the CP registration fee in addition to the workshop fee. The proceedings will be published online on this web page and hardcopies will be distributed at CP'09.