The following pages link to (Q3200590):
Displayed 11 items.
- Approximating probabilistic inference in Bayesian belief networks is NP- hard (Q685336) (← links)
- Deliberation scheduling using GSMDPs in stochastic asynchronous domains (Q962948) (← links)
- Embedding decision-analytic control in a learning architecture (Q1182163) (← links)
- Anytime deduction for probabilistic logic (Q1337678) (← links)
- A statistical approach to adaptive problem solving (Q1391900) (← links)
- Criteria-directed task scheduling (Q1606215) (← links)
- BIG: An agent for resource-bounded information gathering and decision making (Q1978790) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Optimal schedules for monitoring anytime algorithms (Q5940820) (← links)
- Monitoring and control of anytime algorithms: A dynamic programming approach (Q5940822) (← links)
- Principles and applications of continual computation (Q5940823) (← links)