Computational-workload based binarization and     partition of qualitative Markov trees for belief combination.

Xin Hong; Weiru Liu; Kenny Adamson

Computational-workload based binarization and partition of qualitative Markov trees for belief combination.

Xin Hong, Weiru Liu, Kenny Adamson

Research output: Contribution to conference › Paper

Original language	English
Pages	306-318
Number of pages	13
Publication status	Published - Jul 2003
Event	of the 7th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’03) - , Denmark Duration: 01 Jul 2003 → 01 Jul 2003

Conference

Conference	of the 7th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’03)
Country/Territory	Denmark
Period	01/07/2003 → 01/07/2003

Cite this

@conference{c96d1270a38549bf92f4ce5be45e959f,

title = "Computational-workload based binarization and partition of qualitative Markov trees for belief combination.",

author = "Xin Hong and Weiru Liu and Kenny Adamson",

year = "2003",

month = jul,

language = "English",

pages = "306--318",

note = "of the 7th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU{\textquoteright}03) ; Conference date: 01-07-2003 Through 01-07-2003",

}

TY - CONF

T1 - Computational-workload based binarization and partition of qualitative Markov trees for belief combination.

AU - Hong, Xin

AU - Liu, Weiru

AU - Adamson, Kenny

PY - 2003/7

Y1 - 2003/7

UR - http://www.scopus.com/inward/record.url?scp=8344266841&partnerID=8YFLogxK

M3 - Paper

SP - 306

EP - 318

T2 - of the 7th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’03)

Y2 - 1 July 2003 through 1 July 2003

ER -

Computational-workload based binarization and partition of qualitative Markov trees for belief combination.

Conference

Other files and links

Cite this