Pages that link to "Item:Q1228439"
From MaRDI portal
The following pages link to On the optimality of algorithms for finite state sequential decision processes (Q1228439):
Displayed 5 items.
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- Dynamic programming is optimal for certain sequential decision processes (Q1139505) (← links)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544) (← links)
- The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)