D. Nilsson

发表

Sequentially finding the-Best List in Hidden Markov Models

J. Goldberger, D. Nilsson, 2001 .

An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems

D. Nilsson, D. Nilsson, 1998, Stat. Comput..

Representing and Solving Decision Problems with Limited Information

Steffen L. Lauritzen, Dennis Nilsson, S. Lauritzen, 2001, Manag. Sci..

Computing bounds on expected utilities based on limited information

Michael Höhle, Dennis Nilsson, D. Nilsson, 2001 .

LIMIDs of decision problems

Steffen L. Lauritzen, Dennis Nilsson, S. Lauritzen, 1999 .

Real Optionality in Gold Operations

D. Nilsson, 2015 .

How to Work With Concept and Activities as a Foreign Hard Discounter in Order to Better Fit the Swedish Market

D. Nilsson, L. Liepe, 2017 .

Markov Limid processes for representing and solving renewal problems

D. Nilsson, A. Kristensen, E. Jørgensen, 2012, Annals of Operations Research.

An efficient algorithm for sequentially finding the N-best list

Jacob Goldberger, Dennis Nilsson, J. Goldberger, 1999 .

Markov Limid processes for representing and solving renewal problems

Anders Ringgaard Kristensen, Dennis Nilsson, Erik Jørgensen, 2014, Ann. Oper. Res..

Methods for evaluating Decision Problems with Limited Information

Michael Höhle, Dennis Nilsson, D. Nilsson, 2005 .

Probabilities of Future Decisions

Dennis Nilsson, Finn Verner Jensen, F. V. Jensen, 2000 .

An ecient algorithm for nding the M most probable congurations in probabilistic expert systems

Dennis Kengo Nilsson, D. Nilsson, 1998 .

Sequentially finding the N-Best List in Hidden Markov Models

Jacob Goldberger, Dennis Nilsson, J. Goldberger, 2001, IJCAI.

Solving Influence Diagrams using HUGIN, Shafer-Shenoy and Lazy Propagation pdf

Anders L. Madsen, Dennis Nilsson, A. Madsen, 2001, UAI.

Evaluating Influence Diagrams using LIMIDs

Steffen L. Lauritzen, Dennis Nilsson, S. Lauritzen, 2000, UAI.

Evaluating In uen e Diagrams using LIMIDs

D. Nilsson, 2000 .