{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:09:06Z","timestamp":1729649346153,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1109\/icccn.2010.5560157","type":"proceedings-article","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T16:30:51Z","timestamp":1283877051000},"page":"1-6","source":"Crossref","is-referenced-by-count":5,"title":["Message-Passing for Wireless Scheduling: An Experimental Study"],"prefix":"10.1109","author":[{"given":"Paolo","family":"Giaccone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Devavrat","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential fami-lies, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Foundations and Trends\ufffd in Machine Learning"},{"key":"ref11","article-title":"Generalized belief propagation","volume":"13","author":"yedidia","year":"2001","journal-title":"NIPS"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.2005.856938"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2009.2030448"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ICCV.2003.1238444"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ALLERTON.2008.4797741"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/1555349.1555365"},{"key":"ref6","article-title":"Distributed random access algorithm: Scheduling and congestion control","volume":"abs 907 1266","author":"jiang","year":"2009","journal-title":"CoRR"},{"key":"ref5","article-title":"Randomized scheduling algorithm for queueing networks","volume":"abs 908 3670","author":"shah","year":"2009","journal-title":"CoRR"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref7","article-title":"Hardness of low delay network scheduling","author":"shah","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/380752.380839"},{"year":"1988","author":"pearl","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference","key":"ref9"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/9.182479"}],"event":{"name":"2010 19th International Conference on Computer Communications and Networks ( ICCCN 2010)","start":{"date-parts":[[2010,8,2]]},"location":"Zurich, Switzerland","end":{"date-parts":[[2010,8,5]]}},"container-title":["2010 Proceedings of 19th International Conference on Computer Communications and Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5559661\/5560011\/05560157.pdf?arnumber=5560157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T09:46:49Z","timestamp":1497865609000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5560157\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icccn.2010.5560157","relation":{},"subject":[],"published":{"date-parts":[[2010,8]]}}}