Home
KU Information Services
About KU Scholarworks
 
Browse
Communities
& Collections
Issue Date
Author
Title
Subject
 
Sign on to:
Receive email
updates
My KU Scholarworks
authorized users
Edit Profile
 

Advanced Search

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

Full metadata record

DC FieldValueLanguage
dc.contributor.authorShafer, Glenn-
dc.contributor.authorShenoy, Prakash P.-
dc.date.accessioned2004-12-13T21:49:48Z-
dc.date.available2004-12-13T21:49:48Z-
dc.date.issued1991-07-
dc.identifier.urihttp://hdl.handle.net/1808/143-
dc.descriptionThis is an unpublished monograph that was widely distributed (and cited). It was first written in August 1988 and subseqently revised.en
dc.description.abstractThe 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.en
dc.description.sponsorshipResearch 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.en
dc.format.extent1967413 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen_US-
dc.relation.ispartofseriesSchool of Business Working Paper;No. 201-
dc.subjectlocal computationen
dc.subjectBayesian networksen
dc.subjectDempster-Shafer belief function theoryen
dc.subjectconstraint satisfactionen
dc.subjectdynamic programmingen
dc.subjectdiscrete optimizationen
dc.titleLocal Computation in Hypertreesen
dc.typeBooken
dc.typeWorking Paperen
Appears in Collections:School of Business Working Papers

Files in this Item:

File Description SizeFormat
WP201.pdf1.92 MBAdobe PDFView/Open

Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.