The following pages link to Michael L. Littman (Q230823):
Displaying 28 items.
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- (Q413840) (redirect page) (← links)
- Knows what it knows: a framework for self-aware learning (Q413843) (← links)
- (Q589149) (redirect page) (← links)
- Reducing reinforcement learning to KWIK online regression (Q616761) (← links)
- Democratic approximation of lexicographic preference models (Q646538) (← links)
- Most relevant explanation: Computational complexity and approximation methods (Q766267) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- An analysis of model-based interval estimation for Markov decision processes (Q959899) (← links)
- A hierarchy of prescriptive goals for multiagent learning (Q1028932) (← links)
- A tutorial on partially observable Markov decision processes (Q1042307) (← links)
- Convergence results for single-step on-policy reinforcement-learning algorithms (Q1568533) (← links)
- Dimension reduction and its application to model-based exploration in continuous spaces (Q1959610) (← links)
- Optimization problems involving collections of dependent objects (Q2271875) (← links)
- (Q2741536) (← links)
- (Q2751046) (← links)
- (Q2880957) (← links)
- (Q2880979) (← links)
- On the Computational Complexity of Stochastic Controller Optimization in POMDPs (Q2947572) (← links)
- Learning Lexicographic Preference Models (Q3061123) (← links)
- (Q4215779) (← links)
- (Q4536701) (← links)
- (Q4536707) (← links)
- (Q4546684) (← links)
- (Q4737965) (← links)
- (Q5148991) (← links)
- Stochastic Boolean satisfiability (Q5956121) (← links)
- A probabilistic approach to solving crossword puzzles (Q5958200) (← links)
