AIJ Special Issue on Computational Tradeoffs Under Bounded Resources

Artificial Intelligence Journal

Special Issue on Computational Tradeoffs Under Bounded Resources

Guest Editors:
Eric Horvitz and Shlomo Zilberstein

Note that submission deadline is extended to November 30, 1998

Call for papers:

Over the last decade, AI researchers have investigated flexible inferential procedures and representations that allow reasoning systems to gracefully trade off one or more dimensions of the quality of inferred results for the quantity of time or memory required to generate the results. Methods for monitoring and controlling flexible procedures hold opportunity for endowing intelligent systems with the ability to tailor inference dynamically to specific limitations or variations in available computational resources, depending on the situation or environment. Research on flexible procedures and the control of computational tradeoffs under bounded resources has been referred to in a variety of ways depending on specific details of the procedures and the application area, including flexible computation, anytime algorithms, imprecise computation, design-to-time scheduling, memory-bounded search, and resource-bounded reasoning. This special issue of AI Journal will bring together articles describing effective solutions to challenges with the development and control of flexible procedures, including problems with the composition, monitoring, and guidance of inference under limited resources. In addition to papers on principles for characterizing and handling computational tradeoffs under bounded resources, we invite studies in application areas such as heuristic search, constraint satisfaction, probabilistic inference, planning and scheduling, signal interpretation, medical diagnosis and treatment, and intelligent information retrieval.

Topics of interest include:

Computational tradeoffs in inference, planning, and search
Flexible representations of knowledge, problem instances
Representation and measurement of computational tradeoffs
Methods for learning about performance and tradeoffs
Dependency of performance on details of problem instances
Flexibility in problem solving procedures
Real-time monitoring of solution quality
Strategies for allocating resources among reasoning subproblems
Partitioning resources between metalevel and object-level reasoning
Evaluation of methods for decisions about computational tradeoffs
Scalability to real-world solutions and applications

Submission information:

Deadline for submissions: November 30, 1998.

Please submit the manuscript as a PostScript file via electronic mail to aij98@golem.cs.umass.edu or via ftp to ftp.research.microsoft.com/incoming/flexcomp (login as anonymous). If electronic submission is not possible, send three copies of the manuscript to one of the editors. Submission guidelines are available on-line at http://www.elsevier.nl/locate/artint.

For additional information, contact the editors of the special issue: