| Call for tutorial proposals |
|
The tutorials will be held the day before the technical program starts. Tutorials will be free of charge for conference participants. We aim at a small number of high-quality tutorials suitable for a large percentage of conference participants, including graduate students as well as experienced researchers and practitioners. ContentsTutorials should give a comprehensive, in-depth perspective on innovative AI methods or technologies that have an obvious potential for research and/or application and are not covered by typical AI textbooks. We especially encourage tutorial proposals covering cognitive aspects of AI. Do not hesitate to contact the conference or tutorial Chairs if you are in doubt about the suitability of a particular topic for the purpose. Both full-day (6 hours) and half-day (3 hours) tutorials are of interest. TechnicalitiesKI-2008 tutorials will be held on September 23, 2008. They should preferably be given in English. The revenue for tutor(s) consists of free participation at the KI-2008 conference, plus reasonable travel support if necessary. Teaching material will be printed and distributed by the conference organization. How to Propose a TutorialProposals must contain the necessary information to judge the importance, quality and community interest in the proposed tutorial as well as the expertise of its tutor(s). Proposals must include descriptions of the tutorial topic, goals, the intended audience, an outline of the contents, and brief CVs of the tutor(s), including their expertise and teaching experience in the field, and the intended length (half- or full- day). Proposers are encouraged to include excerpts of material from recent teaching about the proposed topic as an annex of their submission, if available. Proposal texts should be submitted by email to the Tutorial Chair Frank Bomarius (frank.bomarius (at) iese fraunhofer de) in plain text format. Annexes may be sent as .pdf, .ps, .ppt, or .doc format. Important DatesProposal deadline: March 28, 2008 |








