Optimal composition of real-time systems
From MaRDI portal
Recommendations
Cites work
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Depth-first iterative-deepening: An optimal admissible tree search
- Fuzzy logic and approximate reasoning
- scientific article; zbMATH DE number 4174360 (Why is no real title available?)
- scientific article; zbMATH DE number 67465 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Real-time heuristic search
- Variable precision logic
Cited in
(13)- Rationality and intelligence
- Coalitions among computationally bounded agents
- Criteria-directed task scheduling
- Optimizing path real-time logic for unified real-time system
- scientific article; zbMATH DE number 67465 (Why is no real title available?)
- scientific article; zbMATH DE number 915992 (Why is no real title available?)
- Optimal schedules for monitoring anytime algorithms
- Iterative state-space reduction for flexible computation
- Monitoring and control of anytime algorithms: A dynamic programming approach
- Principles and applications of continual computation
- Searching stochastically generated multi-abstraction-level design spaces
- Bargaining with limited computation: Deliberation equilibrium
- Contract scheduling with predictions
This page was built for publication: Optimal composition of real-time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674202)