{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:01:25Z","timestamp":1725541285908},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/icpr.2016.7900285","type":"proceedings-article","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T21:12:47Z","timestamp":1493068367000},"page":"4154-4159","source":"Crossref","is-referenced-by-count":0,"title":["Dilemma First Search for effortless optimization of NP-hard problems"],"prefix":"10.1109","author":[{"given":"Julien","family":"Weissenberg","sequence":"first","affiliation":[]},{"given":"Hayko","family":"Riemenschneider","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Dragon","sequence":"additional","affiliation":[]},{"given":"Luc","family":"Van Gool","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","article-title":"Branch-and-bound search algorithms and their computational complexity","author":"zhang","year":"1996","journal-title":"Technical Report University of Southern California"},{"journal-title":"Knapsack Problems","year":"2004","author":"hans","key":"ref10"},{"key":"ref11","article-title":"Limited Discrepancy Search","author":"harvey","year":"1995","journal-title":"International Joint Conference on Artificial Intelligence"},{"journal-title":"Artificial Intelligence Planning Systems","year":"1992","author":"hendler","key":"ref12"},{"key":"ref13","article-title":"Bandit based monte-carlo planning","author":"kocsis","year":"2006","journal-title":"ECML"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.13.9.723"},{"journal-title":"Algorithms and Theory of Computation Handbook","year":"1999","author":"korf","key":"ref15"},{"journal-title":"Combinatorial Algorithms CRC","year":"1998","author":"kreher","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-26325-X_36"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"journal-title":"Knapsack Problems Algorithms and ComputerImplementations Wiley","year":"1990","author":"martello","key":"ref19"},{"key":"ref28","article-title":"Procedural modeling and image-based 3d reconstruction of complex architectures through random walks","author":"teboul","year":"2010","journal-title":"IJCV"},{"key":"ref4","article-title":"R-max-a general polynomial time algorithm for near-optimal reinforcement learning","author":"brafman","year":"2003","journal-title":"Journal of ML Research"},{"journal-title":"Approximate Inference in Graphical Models Using Lp Relaxations","year":"2010","author":"sontag","key":"ref27"},{"key":"ref3","article-title":"Gool. Superpixel Meshes for Edge-Preserving Surface Reconstruction","author":"bodis-szomoru","year":"2015","journal-title":"CVPR"},{"journal-title":"Classification and Regression Trees","year":"1984","author":"breiman","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF02243880"},{"key":"ref5","article-title":"Random forests","author":"breiman","year":"2001","journal-title":"Machine Learning"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100217"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90204-6"},{"key":"ref2","article-title":"Global tree optimization: A non-greedy decision tree algorithm","author":"bennett","year":"1994","journal-title":"Computing Scienceand Statistics"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"ref1","article-title":"Shape quantization and recognition with randomized trees","author":"amit","year":"1996","journal-title":"Neural Computation"},{"key":"ref20","article-title":"Efficient non-greedy optimization of decision trees","author":"norouzi","year":"2015","journal-title":"NIPS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.23"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.3233\/AIC-2012-0531","article-title":"Anytime and\/or depth-first search for combinatorial optimizatian","author":"otten","year":"2012","journal-title":"AI communications"},{"journal-title":"C4 5 Programs for Machine Learning","year":"1993","author":"quinlan","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116251"},{"key":"ref26","article-title":"Learning Where To Classify In Multi-View Semantic Segmentation","author":"riemenschneider","year":"2014","journal-title":"ECCV"},{"key":"ref25","article-title":"Global refinement of random forest","author":"ren","year":"2015","journal-title":"CVPR"}],"event":{"name":"2016 23rd International Conference on Pattern Recognition (ICPR)","start":{"date-parts":[[2016,12,4]]},"location":"Cancun","end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 23rd International Conference on Pattern Recognition (ICPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7893644\/7899596\/07900285.pdf?arnumber=7900285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T05:10:48Z","timestamp":1601961048000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7900285\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icpr.2016.7900285","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}