{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T20:41:57Z","timestamp":1747773717360,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1109\/wcnc.2006.1696642","type":"proceedings-article","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T13:01:13Z","timestamp":1158930073000},"page":"2229-2234","source":"Crossref","is-referenced-by-count":2,"title":["An efficient runtime offloading approach for pervasive services"],"prefix":"10.1109","author":[{"family":"Shumao Ou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Kun Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Qingfu Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2005","key":"15"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/502251.502257"},{"year":"2005","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.47"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/EDOC.1998.723260"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2004.1321031"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2002.1022259"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/98.943998"},{"key":"10","first-page":"307","article-title":"Binary Component Adaptation","volume":"1445","author":"keller","year":"1998","journal-title":"Springer LNCS"},{"key":"7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","article-title":"Multilevel k-way partitioning scheme for irregular graphs","volume":"48","author":"karypis","year":"1998","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"5","article-title":"Multilevel algorithms for multi-constraint graph partitioning","author":"karypis","year":"1998","journal-title":"Proc Super Compting'98"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"9","first-page":"364","article-title":"An Easy-to-Use Toolkit for Efficient Java Bytecode Translators","volume":"2830","author":"chiba","year":"2003","journal-title":"LNCS"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"8"}],"event":{"name":"IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.","start":{"date-parts":[[2006,4,3]]},"location":"Las Vegas, NV, USA","end":{"date-parts":[[2006,4,6]]}},"container-title":["IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/11060\/34937\/01696642.pdf?arnumber=1696642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T05:29:56Z","timestamp":1497677396000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1696642\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/wcnc.2006.1696642","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}