|
KU ScholarWorks >
School of Business >
School of Business Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1808/182
|
|
View usage statistics
|
Full metadata record
| DC Field | Value | Language |
|---|
| dc.contributor.author | Shenoy, Prakash P. | - |
| dc.date.accessioned | 2004-12-21T01:01:04Z | - |
| dc.date.available | 2004-12-21T01:01:04Z | - |
| dc.date.issued | 1996 | - |
| dc.identifier.citation | Shenoy, P. P., "Axioms for Dynamic Programming," in A. Gammerman (ed.), Computational Learning and Probabilistic Reasoning, 1996, pp. 259--275, John Wiley & Sons, Chichester. | en |
| dc.identifier.isbn | 0-471-96279-1 | - |
| dc.identifier.uri | http://hdl.handle.net/1808/182 | - |
| dc.description.abstract | This paper describes an abstract framework, called valuation networks (VN), for representing and solving discrete optimization problems. In VNs, we represent information in an optimization problem using functions called valuations. Valuations represent factors of an objective function. Solving a VN involves using two operators called combination and marginalization. The combination operator tells us how to combine the factors of the objective function to form the global objective function (also called the joint valuation). Marginalization is either maximization or minimization. Solving a VN can be described simply as finding the marginal of the joint valuation for the empty set. We state some simple axioms that combination and marginalization need to satisfy to enable us to solve a VN using local computation. We describe a fusion algorithm for solving a VN using local computation. For optimization problems, the fusion algorithm reduces to non-serial dynamic programming. Thus the fusion algorithm can be regarded as an abstract description of the dynamic programming method, and the axioms can be viewed as conditions that permit the use of dynamic programming. | en |
| dc.format.extent | 126895 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en | - |
| dc.publisher | John Wiley & Sons Ltd | en |
| dc.subject | Discrete optimization | en |
| dc.subject | Local computation | en |
| dc.subject | Dynamic programming | en |
| dc.subject | Axioms for dynamic programming | en |
| dc.subject | Shenoy-Shafer architecture | en |
| dc.subject | valuation networks | en |
| dc.title | Axioms for Dynamic Programming | en |
| dc.type | Book chapter | en |
| Appears in Collections: | School of Business Articles
|
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
|
top