Heyman, D., & Sobel, M. (1984). Stochastic methods in operations research: stochastic optimization. McGraw-Hill.

Howard, R. A. (1960). Dynamic Programming and Markov Processes. MIT Press, Cambridge.

Howard, R. A., & Matheson, J. (1984). Influence diagrams. Principles and Applications of Decision Analysis, 2.

Isard, M., & Blake, A. (1996). Contour tracking by stochastic propagation of conditional density. In Proccedings of Europian Conference on Computer Vision, pp. 343-356.

Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1999).  Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101, 99–134.

Kanazawa, K., Koller, D., & Russell, S. J. (1995).  Stochastic simulation algorithms for dynamic probabilistic networks. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 346-351.

Kearns, M., Mansour, Y., & Ng, A. Y. (1999). A sparse sampling algorithm for near optimal planning in large Markov decision processes. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 1324-1331.

Kjaerulff, U. (1992). A computational scheme for reasoning in dynamic probabilistic networks. In Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence, pp. 121-129.

Korf, R. (1985). Depth-first iterative deepening: an optimal admissible tree search. Artificial Intelligence, 27, 97-109.

Kushmerick, N., Hanks, S., & Weld, D. (1995). An algorithm for probabilistic planning.

Artificial Intelligence, 76, 239-286.

Lauritzen, S. L. (1996). Graphical models. Clarendon Press.

Littman, M. L. (1994). Memoryless policies: Theoretical limitations and practical results.

In Cliff, D., Husbands, P., Meyer, J., & Wilson, S. (Eds.), From Animals to Animats 3: Proceedings of the Third International Conference on Simulation of Adaptive Behavior. MIT Press, Cambridge.

Littman, M. L. (1996). Algorithms for sequential decision making. Ph.D. thesis, Brown University.

Littman, M. L., Cassandra, A. R., & Kaelbling, L. P. (1995). Learning policies for partially observable environments: scaling up. In Proceedings of the Twelfth International Conference on Machine Learning, pp. 362-370.

Lovejoy, W. S. (1991a). Computationally feasible bounds for partially observed Markov decision processes. Operations Research, 39, 192-175.