{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T14:13:13Z","timestamp":1768486393080,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540715894","type":"print"},{"value":"9783540716181","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71618-1_39","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T02:05:53Z","timestamp":1183428353000},"page":"350-357","source":"Crossref","is-referenced-by-count":51,"title":["Wasp Swarm Algorithm for Dynamic MAX-SAT Problems"],"prefix":"10.1007","author":[{"given":"Pedro C.","family":"Pinto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Runkler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o M. C.","family":"Sousa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/B:AGNT.0000018807.12771.60","volume":"8","author":"V.A. Cicirello","year":"2004","unstructured":"Cicirello, V.A., Smith, S.F.: Wasp-like agents for distributed factory coordination. Autonomous Agents and Multi-agent systems\u00a08, 237\u2013266 (2004)","journal-title":"Autonomous Agents and Multi-agent systems"},{"key":"39_CR2","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)"},{"key":"39_CR3","volume-title":"Foundations of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)"},{"key":"39_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johson, D.S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"39_CR5","unstructured":"Hoos, H.H., O\u2019Neill, K.: Stochastic local search methods for dynamic SAT - an initial investigation. In: AAAI-2000 Workshop \u201dLeveraging Probability and Uncertainty in Computation\u201d, Austin, Texas, pp. 22\u201326 (2000)"},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"346","DOI":"10.7551\/mitpress\/3115.003.0047","volume-title":"From Animals to Animats: Proceedings of the First International Conference on Simulation of Adaptive Behavior","author":"G. Theraulaz","year":"1991","unstructured":"Theraulaz, G., Goss, S., Gervet, J., Deneubourg, J.L.: Task differentiation in polistes wasps colonies: A model for self-organizing groups of robots. In: From Animals to Animats: Proceedings of the First International Conference on Simulation of Adaptive Behavior, pp. 346\u2013355. MIT Press, Cambridge (1991)"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Reactive search, a history-based heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics 2 (1997)","DOI":"10.1145\/264216.264220"},{"key":"39_CR8","unstructured":"Roli, A., Blum, C., Dorigo, M.: ACO for maximal constraint satisfaction problems. In: MIC\u20192001 - Metaheuristics International Conference, Porto, Portugal, pp. 187\u2013192 (2001)"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Local search algorithms for SAT: an empirical evaluation. Journal of Automated Reasoning, special Issue \u201dSAT 2000\u201d, 421\u2013481 (1999)","DOI":"10.1023\/A:1006350622830"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 521\u2013532 (1996)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"39_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44886-1_12","volume-title":"Advances in Artificial Intelligence","author":"K. Smyth","year":"2003","unstructured":"Smyth, K., Hoos, H.H., St\u00fctzle, T.: Iterated robust tabu search for MAX-SAT. In: Xiang, Y., Chaib-draa, B. (eds.) Canadian AI 2003. LNCS (LNAI), vol.\u00a02671, pp. 129\u2013144. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71618-1_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T17:58:21Z","timestamp":1708019901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71618-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540715894","9783540716181"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71618-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}