GREAT : A Model of Progressive Reasoning for Real-Time Systems
Identifieur interne : 00D277 ( Main/Merge ); précédent : 00D276; suivant : 00D278GREAT : A Model of Progressive Reasoning for Real-Time Systems
Auteurs : A.-I. Mouaddib ; F. Charpillet ; Jean-Paul Haton [France]Source :
English descriptors
- KwdEn :
Abstract
The problem of producing timely responses when faced with deadlines is an important issue for real-time systems. To deal with this problem different kinds of scheduling algorithms have been developed within the real-time community. Unfortunately, these approaches fail when applied to knowledge based systems, mainly because AI techniques rely on time-consuming algorithms with unpredictable, or highly variable performances. To face this problem researchers in AI have introduced deliberative techniques that enable to adapt the way a task is working in function of the available time. For this purpose approximation algorithms of two kinds have been developed : iterative refinement and multiple methods. The model we propose in this paper, belongs to iterative refinement methods. The main advantage of our approach is the capability of designing iterative refinement methods using a general rule language.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001557
- to stream Crin, to step Curation: 001557
- to stream Crin, to step Checkpoint: 002F79
Links to Exploration step
CRIN:mouaddib94fLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="46">GREAT : A Model of Progressive Reasoning for Real-Time Systems</title></titleStmt><publicationStmt><idno type="RBID">CRIN:mouaddib94f</idno><date when="1994" year="1994">1994</date><idno type="wicri:Area/Crin/Corpus">001557</idno><idno type="wicri:Area/Crin/Curation">001557</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001557</idno><idno type="wicri:Area/Crin/Checkpoint">002F79</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002F79</idno><idno type="wicri:Area/Main/Merge">00D277</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">GREAT : A Model of Progressive Reasoning for Real-Time Systems</title><author><name sortKey="Mouaddib, A I" sort="Mouaddib, A I" uniqKey="Mouaddib A" first="A.-I." last="Mouaddib">A.-I. Mouaddib</name></author><author><name sortKey="Charpillet, F" sort="Charpillet, F" uniqKey="Charpillet F" first="F." last="Charpillet">F. Charpillet</name></author><author><name sortKey="Haton, J P" sort="Haton, J P" uniqKey="Haton J" first="J.-P." last="Haton">Jean-Paul Haton</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>artificial intelligence</term><term>planning</term><term>real time</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2581">The problem of producing timely responses when faced with deadlines is an important issue for real-time systems. To deal with this problem different kinds of scheduling algorithms have been developed within the real-time community. Unfortunately, these approaches fail when applied to knowledge based systems, mainly because AI techniques rely on time-consuming algorithms with unpredictable, or highly variable performances. To face this problem researchers in AI have introduced deliberative techniques that enable to adapt the way a task is working in function of the available time. For this purpose approximation algorithms of two kinds have been developed : iterative refinement and multiple methods. The model we propose in this paper, belongs to iterative refinement methods. The main advantage of our approach is the capability of designing iterative refinement methods using a general rule language.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00D277 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00D277 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:mouaddib94f
|texte= GREAT : A Model of Progressive Reasoning for Real-Time Systems
}}
| This area was generated with Dilib version V0.6.33. |  |