%0 Conference Paper %1 conf/cp/LelisOD14 %A Lelis, Levi H. S. %A Otten, Lars %A Dechter, Rina %B CP %D 2014 %E O'Sullivan, Barry %I Springer %K dblp %P 481-496 %T Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. %U http://dblp.uni-trier.de/db/conf/cp/cp2014.html#LelisOD14 %V 8656 %@ 978-3-319-10427-0

@inproceedings{conf/cp/LelisOD14, added-at = {2017-05-17T00:00:00.000+0200}, author = {Lelis, Levi H. S. and Otten, Lars and Dechter, Rina}, biburl = {https://www.bibsonomy.org/bibtex/2e6f625be66f8601bb35047f7b28fcfd3/dblp}, booktitle = {CP}, crossref = {conf/cp/2014}, editor = {O'Sullivan, Barry}, ee = {https://doi.org/10.1007/978-3-319-10428-7_36}, interhash = {dc0531ea4435b9bf0149aeadd98d3de1}, intrahash = {e6f625be66f8601bb35047f7b28fcfd3}, isbn = {978-3-319-10427-0}, keywords = {dblp}, pages = {481-496}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T15:20:02.000+0200}, title = {Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models.}, url = {http://dblp.uni-trier.de/db/conf/cp/cp2014.html#LelisOD14}, volume = 8656, year = 2014 }