Wasp swarm algorithm for dynamic MAX-SAT problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4431 LNCS, Issue PART 1, 2007, Pages 350-357

  Pinto, Pedro C ^a,b   Runkler, Thomas A ^b   Sousa, João M C ^b  

^a SIEMENS AG   (Germany)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETER ESTIMATION; PROBLEM SOLVING;

SATISFIABILITY PROBLEM; WASP SWARM OPTIMIZATION;

ALGORITHMS;

EID: 38049058246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71618-1_39     Document Type: Conference Paper

References (11)

1. Cicirello, V.A., Smith, S.F.: Wasp-like agents for distributed factory coordination. Autonomous Agents and Multi-agent systems 8 (2004) 237-266
2. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann (2004)
3. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)
4. Garey, M.R., Johson, D.S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman Publishers (1979)
5. Hoos, H.H., O'Neill, K.: Stochastic local search methods for dynamic SAT - an initial investigation. AAAI-2000 Workshop "Leveraging Probability and Uncertainty in Computation", Austin, Texas (2000) 22-26
6. G. Theraulaz, S. Goss, J.G., Deneubourg, J.L.: Task differentiation in polistes wasps colonies: A model for self-organizing groups of robots. In: From Animals to Animais: Proceedings of the First International Conference on Simulation of Adaptive Behavior, (MIT Press, 1991) 346-355
7. Battiti, R., Protasi, M.: Reactive search, a history-based heuristic for MAX-SAT. ACM Journal of Experimental Algorithmes 2 (1997)
8. Roli, A., Blum, C., Dorigo, M.: ACO for maximal constraint satisfaction problems. MIC'2001 - Metaheuristics International Conference, Porto, Portugal (2001) 187-192
9. Hoos, H.H., Stützle, T.: Local search algorithms for SAT: an empirical evaluation. Journal of Automated Reasoning, special Issue "SAT 2000" (1999) 421-481
10. Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26 (1996) 521-532
11. Smyth, K., Hoos, H.H., Stützle, T.: Iterated robust tabu search for MAX-SAT. Lecture Notes in Computer Science, Springer Verlag 44 (2003) 279-303