I apologize if you have received this CFP more than once. The
submission
deadline is October 30, 1998.
I would like to bring to your attention a forthcoming AAAI-99 Spring
Symposium on Search Strategies under Uncertainty and Incomplete
Information. The Call for Papers is attached below.
If you have any research result or ongoing work related to the topics of
the symposium, please submit an abstract or paper to the symposium. If
you are interested in the symposium and would like to find out what
other researchers and practitioners are doing, just send a short
description of your research interest.
If you know someone who might be interested in the symposium, please
forward the CFP to that person.
Thank you very much for your attention!
-weixiong (wayne) zhang
University of Southern California Tel: (310)822-1511 x 735
Information Sciences Institute & Fax: (310)822-0751
Computer Science Department URL: http://www.isi.edu/isd/zhang
--------------492A63AB906012481096A484
Content-Type: text/html; charset=us-ascii;
name="SearchStrategies.html"
Content-Transfer-Encoding: 7bit
Content-Disposition: inline;
filename="SearchStrategies.html"
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
This symposium will focus on the selection of search strategies for problem solving under uncertainty and incomplete information, where the large number of contingencies can create large search spaces. Therefore, system performance ultimately depends largely on the efficiency of the selected search strategies. Using appropriate search strategies can significantly increase system performance by exploiting problem-specific knowledge and restricting the search to the right regions of the search spaces to find satisfactory solutions quickly.
The main purpose of the symposium is to bring together researchers and practitioners from areas such as planning, heuristic search, robotics, constraint satisfaction, game playing, and information gathering. We want to discuss when and how traditional search techniques (such as state-space search and local search) should be applied; how uncertain and incomplete information can be exploited to control search processes; whether there is a difference in principle between reasoning with deterministic and probabilistic representations of uncertain and incomplete information (for example, with constraint networks or belief networks); how the level of uncertainty affects problem complexity; how different search paradigms (such as heuristic search and dynamic programming) can be combined to provide additional pruning power; and how the structure of search spaces can be exploited to speed up search. We also intend to explore how these search strategies can be applied across domains and application areas, and speculate on promising future search strategies.
The symposium will consist of one or two invited talks, followed by short presentations and longer discussions, in an atmosphere that encourages the interaction of researchers with different backgrounds. There will be plenty of opportunity to discover common ground between different fields and application domains.
All types of papers are sought, including papers describing theory, algorithms, applications, systems, performance measures, and other issues related to search strategies for problem solving under uncertainty and incomplete information. Papers on work in progress are encouraged. Other interested participants should send a short description of their research interests with a list of relevant publications. Suggestions for panel and group discussions are also welcome.
Submission in postscript format should be sent, electronically, to zhang@isi.edu.
Authors should follow the general AAAI submission guidelines (see Author
Instruction for details). The maximum length should be limited to six
pages, in AAAI format.
--------------492A63AB906012481096A484--