| dc.contributor.author | Shafer, Glenn R. | |
| dc.contributor.author | Shenoy, Prakash P. | |
| dc.date.accessioned | 2004-12-13T21:49:48Z | |
| dc.date.available | 2004-12-13T21:49:48Z | |
| dc.date.issued | 1991-07 | |
| dc.identifier.uri | http://hdl.handle.net/1808/143 | |
| dc.description | This is an unpublished monograph that was widely distributed (and cited). It was first written in August 1988 and subseqently revised. | |
| dc.description.abstract | The monograph describes theory and algorithms for computation of marginals using local computation that applies to a large number of domains including probability theory, Dempster-Shafer theory of belief functions, discrete optimization, and constraint satisfaction. | |
| dc.description.sponsorship | Research described in this monograph was funded by NSF grant IST-8610293, and three grants from KPMG Peat Marwick Foundation's Research Opportunities in Auditing program. | |
| dc.format.extent | 1967413 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | School of Business Working Paper;No. 201 | |
| dc.subject | Local computation | |
| dc.subject | Bayesian networks | |
| dc.subject | Dempster-Shafer belief function theory | |
| dc.subject | Constraint satisfaction | |
| dc.subject | Dynamic programming | |
| dc.subject | Discrete optimization | |
| dc.title | Local Computation in Hypertrees | |
| dc.type | Book | |
| dc.type | Working Paper | |
| kusw.oastatus | na | |
| dc.identifier.orcid | https://orcid.org/0000-0002-8425-896X | |
| kusw.oapolicy | This item does not meet KU Open Access policy criteria. | |
| dc.rights.accessrights | openAccess | |
