Extracting the K best solutions from a valued and-or acyclic graph
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/41540 |
| _version_ | 1826191831480664064 |
|---|---|
| author | Elliott, Paul Harrison, 1979- |
| author2 | Howard Shrobe and Brian C. Williams. |
| author_facet | Howard Shrobe and Brian C. Williams. Elliott, Paul Harrison, 1979- |
| author_sort | Elliott, Paul Harrison, 1979- |
| collection | MIT |
| description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. |
| first_indexed | 2024-09-23T09:01:57Z |
| format | Thesis |
| id | mit-1721.1/41540 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:01:57Z |
| publishDate | 2008 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/415402019-04-10T20:19:45Z Extracting the K best solutions from a valued and-or acyclic graph Elliott, Paul Harrison, 1979- Howard Shrobe and Brian C. Williams. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Includes bibliographical references (p. 117-118). In this thesis, we are interested in solving a problem that arises in model-based programming, specifically in the estimation of the state a system described by a probabilistic model. Some model-based estimators, such as the MEXEC algorithm and the DNNF-based Belief State Estimation algorithm, use a valued and-or acyclic graph to represent the possible estimates. These algorithms specifically use a valued smooth deterministic decomposable negation normal form (sd-DNNF) representation, a type of and-or acyclic graph. Prior work has focused on extracting either all or only the best solution from the sd-DNNF. This work develops an efficient algorithm that is able to extract the k best solutions, where k is a parameter to the algorithm. For a graph with -E- edges, -V - nodes and -Ev- children per non-leaf node, the algorithm presented in this thesis has a time complexity of O(-E-k log k +-E- log -Ev-+-V -k log -Ev-) and a space complexity O(-E-k). by Paul Harrison Elliott. M.Eng. 2008-05-19T14:58:21Z 2008-05-19T14:58:21Z 2007 2007 Thesis http://hdl.handle.net/1721.1/41540 219698650 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 118 p. application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Elliott, Paul Harrison, 1979- Extracting the K best solutions from a valued and-or acyclic graph |
| title | Extracting the K best solutions from a valued and-or acyclic graph |
| title_full | Extracting the K best solutions from a valued and-or acyclic graph |
| title_fullStr | Extracting the K best solutions from a valued and-or acyclic graph |
| title_full_unstemmed | Extracting the K best solutions from a valued and-or acyclic graph |
| title_short | Extracting the K best solutions from a valued and-or acyclic graph |
| title_sort | extracting the k best solutions from a valued and or acyclic graph |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/41540 |
| work_keys_str_mv | AT elliottpaulharrison1979 extractingthekbestsolutionsfromavaluedandoracyclicgraph |