home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.ai
- Path: sparky!uunet!wupost!gumby!destroyer!ubc-cs!kean
- From: kean@cs.ubc.ca (Alex Kean)
- Subject: Re: Anytime algorithms
- Message-ID: <1992Sep9.162602.16453@cs.ubc.ca>
- Sender: usenet@cs.ubc.ca (Usenet News)
- Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
- References: <751@tls-cs.cert.fr>
- Date: Wed, 9 Sep 92 16:26:02 GMT
- Lines: 55
-
- In article <751@tls-cs.cert.fr> adele@tls-cs.cert.fr (Martin Adelantado) writes:
- >
- > We are investigating execution models for intelligent
- >real time systems. These models are based on a mixed
- >synchronous/asynchronous programming approach involving a
- >Synchronous expression (ESTEREL, LUSTRE) of critical real time
- >parts (reactive parts), and an Asynchronous expression of
- >reasoning parts.
- >
- > Expression of reasoning parts involves :
- >
- > -> ANYTIME reasoning algorithms that can produce partial
- > or reduced-quality output when their execution is
- > terminated before some complete solution is produced,
- >
- > -> APPROXIMATE processing solvers that will adaptively
- > generate the most acceptable solutions which meet
- > deadlines.
- >
- > In this context, I should be grateful for information or
- >references to papers relating to these two subjects, ANYTIME
- >reasoning and APPROXIMATE processing.
- >
- > Please email to adele@tls-cs.cert.fr
- >
- >Thanks in advance,
- >
- > Martin ADELANTADO
- > ONERA-CERT/DERI
- > TOULOUSE (FRANCE)
-
- see
-
- @inproceedings{deanboddy88,
- author = "Thomas Dean and Mark Boddy",
- title = "{An Analysis of Time-Dependent Planning}",
- booktitle = "{Proceeding of AAAI-88}",
- year = 1988,
- pages = {49--54}
- }
-
-
- Best Regards,
-
- Alex Kean <kean@cs.ubc.ca>
-
- Department of Computer Science
- University of British Columbia
- 6356 Agricultural Road,
- Vancouver, British Columbia
- Canada V6T 1Z2
-
- Tel: +1 (604)-822-4912
- Fax: +1 (604)-822-5485
-
-