|
KU ScholarWorks >
School of Business >
School of Business Working Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1808/143
|
|
View usage statistics
|
| Title: | Local Computation in Hypertrees |
| Authors: | Shafer, Glenn
Shenoy, Prakash P. |
| Keywords: | local computation
Bayesian networks
Dempster-Shafer belief function theory
constraint satisfaction
dynamic programming
discrete optimization |
| Issue Date: | Jul-1991 |
| Extent: | 1967413 bytes |
| Type: | Book
Working Paper |
| Series/Report no.: | School of Business Working Paper;No. 201 |
| 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. |
| Description: | This is an unpublished monograph that was widely distributed (and cited). It was first written in August 1988 and subseqently revised. |
| URI: | http://hdl.handle.net/1808/143 |
| Appears in Collections: | School of Business Working Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| WP201.pdf | | 1921Kb | Adobe PDF | View/Open |
|
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
|
Copyright © 2006 by the University of Kansas
