Newsgroups: comp.ai.jair.announce
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!godot.cc.duq.edu!newsgate.duke.edu!news.mathworks.com!newsfeed.internetmci.com!news.msfc.nasa.gov!pendragon!ames!cnn.nas.nasa.gov!eos!kronos.arc.nasa.gov!jair-ed
From: jair-ed@ptolemy.arc.nasa.gov
Subject: New Article, Adaptive Problem-solving for Large-scale ...
Message-ID: <1996Jun4.174910.7886@ptolemy-ethernet.arc.nasa.gov>
Originator: jair-ed@polya.arc.nasa.gov
Lines: 40
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: polya.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Tue, 4 Jun 1996 17:49:10 GMT
Approved: jair-ed@ptolemy.arc.nasa.gov

[Apologies to those of you that receive two copies of this]

JAIR is pleased to announce the publication of the following article:

Gratch, J. and Chien, S. (1996)
  "Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study", 
   Volume 4, pages 365-396.

   Available in Postscript (595K) and compressed Postscript (180K).
   For quick access via your WWW browser, use this URL:
     http://www.cs.washington.edu/research/jair/abstracts/gratch96a.html
   More detailed instructions are below.

   Abstract: Although most scheduling problems are NP-hard, domain
   specific techniques perform well in practice but are quite expensive
   to construct.  In adaptive problem-solving solving, domain specific
   knowledge is acquired automatically for a general problem solver with
   a flexible control architecture.  In this approach, a learning system
   explores a space of possible heuristic methods for one well-suited to
   the eccentricities of the given domain and problem distribution.  In
   this article, we discuss an application of the approach to scheduling
   satellite communications.  Using problem distributions based on actual
   mission requirements, our approach identifies strategies that not only
   decrease the amount of CPU time required to produce schedules, but
   also increase the percentage of problems that are solvable within
   computational resource limitations.

The article is available via:
   
 -- comp.ai.jair.papers (also see comp.ai.jair.announce)

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html
    For direct access to this article and related files try:
       http://www.cs.washington.edu/research/jair/abstracts/gratch96a.html

 -- Anonymous FTP from either of the two sites below.

    Carnegie-Mellon University (USA):
	ftp://p.gp.cs.cmu.edu/usr/jair/pub/volume4/gratch96a.ps
    The University of Genoa (Italy):
	ftp://ftp.mrg.dist.unige.it/pub/jair/pub/volume4/gratch96a.ps

    The compressed PostScript file is named gratch96a.ps.Z (180K)

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND and our automailer will respond. To
    get the Postscript file, use the message body GET volume4/gratch96a.ps 
    (Note: Your mailer might find this file too large to handle.) 
    Only one can file be requested in each message.

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, visit our WWW or FTP sites, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.



