{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T22:12:58Z","timestamp":1770243178375,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,26]]},"DOI":"10.1145\/3785520.3785530","type":"proceedings-article","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T09:02:02Z","timestamp":1770195722000},"page":"70-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Detection Tasks with PySwarms: Applications of Paging Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0325-6809","authenticated-orcid":false,"given":"Chau Van","family":"Van","sequence":"first","affiliation":[{"name":"Posts and Telecommunications Institute of Technology, Ho Chi Minh City, Vietnam,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4035-1759","authenticated-orcid":false,"given":"Nguyen Minh","family":"Tuan","sequence":"additional","affiliation":[{"name":"Posts and Telecommunications Institute of Technology, Ho Chi Minh City, Vietnam,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,2,4]]},"reference":[{"key":"e_1_3_3_1_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.07.006"},{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.035"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.04.023"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.12.039"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2024.07.005"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2013.12.270"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2016.05.102"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-98697-0_25"},{"key":"e_1_3_3_1_9_2","first-page":"46","volume-title":"Ha Noi, Viet Nam, ISBN 978-604-67-330-0","author":"Tuan N. M.","year":"2025","unstructured":"Tuan N. M., Son N. H., & Van C. V. (2025). Piecemeal-DFS Algorithm for Energy-Constrained Depth-First Search on the Merging Problem of Two Given Trees (In Vietnamese). The 2nd national symposium on natural sciences and applications in the digital age. On the Proceedings of the National Scientific Conference on Natural Sciences and Applications in the Digital Age (NSA), Ha Noi, Viet Nam, ISBN 978-604-67-330-0, p 46-53."}],"event":{"name":"CCIOT 2025: 2025 10th International Conference on Cloud Computing and Internet of Things","location":"Ho Chi Minh , Vietnam","acronym":"CCIOT 2025"},"container-title":["Proceedings of the 2025 10th International Conference on Cloud Computing and Internet of Things"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3785520.3785530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T09:02:58Z","timestamp":1770195778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3785520.3785530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,26]]},"references-count":9,"alternative-id":["10.1145\/3785520.3785530","10.1145\/3785520"],"URL":"https:\/\/doi.org\/10.1145\/3785520.3785530","relation":{},"subject":[],"published":{"date-parts":[[2025,11,26]]},"assertion":[{"value":"2026-02-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}