Towards a general theory of action and time
Artificial Intelligence
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Parallelism in production systems: the sources and the unexpected speed up
5th international workshop, Vol. 1 on Expert systems & their applications
Real-time knowledge-based systems
AI Magazine
Artificial Intelligence
Planning and control
Case-based reasoning
A survey on temporal reasoning in artificial intelligence
AI Communications
Optimal composition of real-time systems
Artificial Intelligence
Design-to-time scheduling and anytime algorithms
ACM SIGART Bulletin
Artificial Intelligence
A Real-Time Expert System for Quality Control
IEEE Expert: Intelligent Systems and Their Applications
Adaptation through Interpolation for Time-Critical Case-Based Reasoning
EWCBR '93 Selected papers from the First European Workshop on Topics in Case-Based Reasoning
A caching scheme for time-critical knowledge-based computations
IEA/AIE'93 Proceedings of the 6th international conference on Industrial and engineering applications of artificial intelligence and expert systems
| Hi-index | 0.00 |
Knowledge-basedcomputing, in general, suffers from an inherent open-endednessthat precludes its application in time-bounded domains wherean answer must be computed within a stipulated time limit. Weexamine a two-way improvement of the shortcomings: a knowledgerepresentation scheme that provides easy access to relevant knowledgeand thereby reduces search time, and a reasoning scheme thatis algorithmic in nature and thus makes computational requirementsmeaningfully estimable. In this work, we offera cache-based architecture that is capable of both storing knowledgein different formats (e.g. rules, cases), and invoking an appropriatereasoning scheme to fit the available computing time. The cachehelps in retrieving the most relevant pieces of knowledge (notonly exact matches) required for solving a given problem. Thiscache relies on a reasoning tactic, knowledge interpolation,that can generate a solution from two near-matches in an algorithmicway, to generate time-bounded solutions. We illustrate the designof such a cache for solving resource allocation problems in thedomain of shortwave radio transmission and evaluate its performancein observing imposed temporal bounds.