{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:54:41Z","timestamp":1729630481609,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/wsc.2005.1574333","type":"proceedings-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T11:24:16Z","timestamp":1138188256000},"page":"862-868","source":"Crossref","is-referenced-by-count":1,"title":["Approximate\/Perfect Samplers for Closed Jackson Networks"],"prefix":"10.1109","author":[{"given":"S.","family":"Kijima","sequence":"first","affiliation":[]},{"given":"T.","family":"Matsui","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24587-2_69"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/174153.174160"},{"key":"17","article-title":"Polynomial time perfect sampling algorithm for two-rowed contingency tables","author":"kijima","year":"2005","journal-title":"Random Structures Algorithms"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200001)16:1<85::AID-RSA6>3.0.CO;2-H"},{"year":"0","key":"18"},{"key":"15","article-title":"The Markov chain Monte Carlo method: An approach to approximate counting and integration","author":"jerrum","year":"1996","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"16","first-page":"308","article-title":"Approximate counting scheme for m \ufffd n contingency tables","volume":"e87 d","author":"kijima","year":"2004","journal-title":"IEICE Transactions on Information and Systems"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.4.518"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.10.1.131"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.15.2.254"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511613586"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.3.CO;2-R"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0695-1"},{"key":"20","article-title":"Perfect simulation of a closed Jackson network","author":"ozawa","year":"2004","journal-title":"Proceedings of ORSJ Queueing symposium"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321887"},{"key":"1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BFb0068322","article-title":"Random walks on finite groups and rapidly mixing Markov chains","volume":"986","author":"aldous","year":"1982","journal-title":"Springer-Verlag Lecture Notes in Mathematics"},{"journal-title":"Introduction to Queueing Networks","year":"1998","author":"gelenbe","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/290274.290277"},{"journal-title":"Queueing Networks Customers Signals and Product Form Solutions","year":"1999","author":"chao","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362345"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646111"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<290::AID-RSA6>3.0.CO;2-Q"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1027961037"}],"event":{"name":"Winter Simulation Conference, 2005.","location":"Orlando, FL. USA"},"container-title":["Proceedings of the Winter Simulation Conference, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10515\/33294\/01574333.pdf?arnumber=1574333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T22:45:22Z","timestamp":1497653122000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1574333\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/wsc.2005.1574333","relation":{},"subject":[]}}