{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:55:46Z","timestamp":1730296546305,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sis.2005.1501635","type":"proceedings-article","created":{"date-parts":[[2005,8,30]],"date-time":"2005-08-30T14:00:41Z","timestamp":1125410441000},"page":"294-301","source":"Crossref","is-referenced-by-count":2,"title":["Swarm reasoning"],"prefix":"10.1109","author":[{"given":"D.","family":"Palmer","sequence":"first","affiliation":[]},{"given":"M.","family":"Kirschenbaum","sequence":"additional","affiliation":[]},{"given":"J.","family":"Shifflet","sequence":"additional","affiliation":[]},{"given":"L.","family":"Seiter","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"An Experimental Investigation of Iterated Local Search for Coloring Graphs","year":"0","author":"paquete","key":"13"},{"journal-title":"Four Colors Suffice","year":"2000","author":"wilson","key":"14"},{"key":"11","article-title":"Experiments with parallel graph coloring heuristics and applications of graph coloring","author":"lewandowski","year":"1994","journal-title":"DIMACS Series in Discrete Mathematics"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2003.1202248"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600357"},{"key":"2","article-title":"An ant algorithm for the graph colouring problem","author":"comellas","year":"0","journal-title":"From Ant Colonies to Artificial Ants 1st International Workshop on ACO"},{"key":"1","first-page":"17","article-title":"Exploratory design of swarms","author":"bonabeau","year":"0","journal-title":"Proceedings of the 2nd International Workshop on the Mathematics and Algorithms of Social Insects"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.6028\/jres.084.024"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1977","author":"garey","key":"7"},{"journal-title":"An Evolutionary Annealing Approach to Graph Coloring","year":"0","author":"fotakis","key":"6"},{"journal-title":"Improvements on Constructive Genetic Approaches to Graph Coloring","year":"0","author":"filho","key":"5"},{"key":"4","first-page":"47","article-title":"Rules of decision making: Trade-offs in collective house hunting","author":"dornhaus","year":"0","journal-title":"2nd International Workshop on the Mathematics and Algorithms of Social Insects"},{"key":"9","article-title":"Swarm intelligence for routing in satellite and sensor networks","author":"kassabalidis","year":"0","journal-title":"NASA Earth Science Technology Conference"},{"key":"8","first-page":"152","article-title":"A neural networks algorithm for the minimum coloring problem using FPGAs","volume":"12","author":"harmanani","year":"0","journal-title":"LASTED Internation Conference Applied Simulation and Modelling"}],"event":{"name":"2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005.","location":"Pasadena, CA, USA"},"container-title":["Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10043\/32218\/01501635.pdf?arnumber=1501635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T23:30:04Z","timestamp":1489534204000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1501635\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/sis.2005.1501635","relation":{},"subject":[]}}