{"type":"ScholarlyArticle","title":"A Comparison of Time-Space Schemes for Graphical Models","authors":[{"name":"Robert Mateescu","slug":"robert-mateescu","given":"Robert","family":"Mateescu","affiliation":""},{"name":"Rina Dechter","slug":"rina-dechter","given":"Rina","family":"Dechter","affiliation":""}],"abstract":"We investigate three parameterized algorithmic schemes for graphical models that can accommodate trade-offs between time and space: 1) AND/OR Adaptive Caching (AOC(i)); 2) Variable Elimination and Conditioning (VEC(i)); and 3) Tree Decomposition with Conditioning (TDC(i)). We show that AOC(i) is better than the vanilla versions of both VEC(i) and TDC(i), and use the guiding principles of AOC(i)to improve the other two schemes. Finally, we show that the improved versions of VEC(i) and TDCI can be simulated by AOC(i), which emphasizes the unifying power of the AND/OR framework.","doi":null,"url":"https://ijcai.org/proceedings/2007/378","pdf":"https://ijcai.org/proceedings/2007/0378.pdf","markdown":"https://ijcai.org/proceedings/2007/378.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/378","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":378,"pages":{"first":2346,"last":2351},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}