{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:32:09Z","timestamp":1730205129515,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/cec.2018.8477840","type":"proceedings-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T13:12:42Z","timestamp":1542028362000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Novel Parallel Anytime A* for Graph and Network Clustering"],"prefix":"10.1109","author":[{"given":"Rudson Francisco","family":"Da Silva Mendes","sequence":"first","affiliation":[{"name":"Universidade do Vale do Itajaí, Laboratory of Applied Intelligence, Itajaí, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"De Santiago","sequence":"additional","affiliation":[{"name":"Universidade do Vale do Itajaí, Laboratory of Applied Intelligence, Itajaí, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis C.","family":"Lamb","sequence":"additional","affiliation":[{"name":"Federal University of Rio Grande do Sul, Institute of Informatics, Porto Alegre, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"73","article-title":"Using Anytime Algorithms in Intelligent Systems","volume":"17","author":"zilberstein","year":"1996","journal-title":"AI Magazine"},{"key":"ref32","first-page":"4618","article-title":"On the Role of Degree Influence in Suboptimal Modularity Maximization","author":"santiago","year":"2016","journal-title":"IEEE Congress on Evolutionary Computation Vancouver IEEE"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.81.046106"},{"key":"ref30","first-page":"891","article-title":"Grid Pathfinding on the 2 k Neighborhoods","author":"hern","year":"2017","journal-title":"Proceedings of the 31th Conference on Artificial Intelligence (AAAI 2017)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.01.009"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2096"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.04.013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190689"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1609\/aaai.v27i1.8455","article-title":"Fast Algorithm for Modularity-Based Graph Clustering","author":"shiokawa","year":"2013","journal-title":"Twenty-Seventh Conference on Artificial Intelligence"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3067695.3075995"},{"key":"ref16","first-page":"29","article-title":"Community detection based on modularity density and genetic algorithm","author":"liu","year":"2010","journal-title":"Proceedings of International Conference on Computational Aspects of Social Networks"},{"key":"ref17","first-page":"1","article-title":"An improved memetic algorithm for community detection in complex networks","author":"gong","year":"2012","journal-title":"2012 IEEE Congress on Evolutionary Computation Brisbane QLD IEEE"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-014-0433-6"},{"key":"ref19","first-page":"856","article-title":"Simpler Bounded Suboptimal Search","author":"hatem","year":"2014","journal-title":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence"},{"key":"ref28","first-page":"1158","article-title":"Reusing Previously Found A Paths for Fast Goal-Directed Navigation in Dynamic Terrain","author":"hernandez","year":"2015","journal-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2014.03.041"},{"key":"ref27","first-page":"878","article-title":"Identifying Hierarchies for Fast Optimal Search","author":"uras","year":"2014","journal-title":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Identifying"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.03.024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.036109"},{"key":"ref29","first-page":"746","article-title":"Combining Bounding Boxes and JPS to Prune Grid Pathfinding","author":"rabin","year":"2016","journal-title":"Proc of the Thirtieth AAAI Conference on Artificial Intelligence"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2016.08.003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.03.012"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.10.033"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature03288"},{"key":"ref9","first-page":"1","author":"sato","year":"2017","journal-title":"A branch-and-price approach with MILP formulation to modularity density maximization on graphs"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"ref20","first-page":"885","article-title":"Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search","author":"valenzano","year":"2014","journal-title":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Worst-Case"},{"key":"ref22","first-page":"1086","article-title":"Limitations of Front-To-End Bidirectional Heuristic Search","author":"barker","year":"2015","journal-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Limitations"},{"key":"ref21","first-page":"1079","article-title":"Optimal Column Subset Selection by A-Star Search","author":"arai","year":"2015","journal-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence"},{"key":"ref24","first-page":"666","article-title":"Unsupervised Feature Selection by Heuristic Search with Provable Bounds on Suboptimality","author":"arai","year":"2016","journal-title":"Proc of the Thirtieth AAAI Conference on Artificial Intelligence"},{"key":"ref23","first-page":"1248","article-title":"Massively Parallel A Search on a GPU","author":"zhou","year":"2015","journal-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence"},{"key":"ref26","first-page":"871","article-title":"Exponential Deepening A for Real-Time Agent-Centered Search","author":"sharon","year":"2014","journal-title":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence"},{"key":"ref25","first-page":"673","article-title":"Tiebreaking Strategies for A Search: How to Explore the Final Frontier","author":"asai","year":"2016","journal-title":"Proc of the Thirtieth AAAI Conference on Artificial Intelligence"}],"event":{"name":"2018 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2018,7,8]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2018,7,13]]}},"container-title":["2018 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8466244\/8477640\/08477840.pdf?arnumber=8477840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:26:58Z","timestamp":1673648818000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8477840\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/cec.2018.8477840","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}