{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:22:11Z","timestamp":1773156131096,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T00:00:00Z","timestamp":1697155200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,13]]},"DOI":"10.1145\/3640771.3641824","type":"proceedings-article","created":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T18:08:54Z","timestamp":1711735734000},"page":"82-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Method for Task Offloading based on Multi-agent Deep Deterministic Policy Gradient(MADDPG) and Minimum Cost Maximum Flow(MCMF) in Internet of Vehicles(IoVs)"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4900-4629","authenticated-orcid":false,"given":"Zhiping","family":"Ouyang","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Science, Guangzhou University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3774-6645","authenticated-orcid":false,"given":"Liang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science, Guangzhou University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3878-3870","authenticated-orcid":false,"given":"Bo","family":"Wang","sequence":"additional","affiliation":[{"name":"The Second Elementary School of Zhucun Street, China"}]}],"member":"320","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3160099"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.07.019"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021800142252019X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP49889.2020.9299723"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2022.01.016"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2965898"}],"event":{"name":"ISCAI 2023: 2023 2nd International Symposium on Computing and Artificial Intelligence","location":"Shanghai China","acronym":"ISCAI 2023"},"container-title":["Proceedings of the 2023 2nd International Symposium on Computing and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3640771.3641824","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3640771.3641824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T02:30:39Z","timestamp":1755916239000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3640771.3641824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,13]]},"references-count":6,"alternative-id":["10.1145\/3640771.3641824","10.1145\/3640771"],"URL":"https:\/\/doi.org\/10.1145\/3640771.3641824","relation":{},"subject":[],"published":{"date-parts":[[2023,10,13]]},"assertion":[{"value":"2024-03-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}