Some references to AI and Parameterized Complexity:
1) The Parameterized Complexity of Global Constraints. Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Claude-Guy Quimper and Toby Walsh. Proceedings of AAAI-2008, 235-240, 2008. Homepage of Toby Walsh.
2) Kernelization as heuristic structure for the vertex cover problem by Stephen Gilmour, Mark Dras. In: Proceedings of the Third Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2006). Gilmour homepage.
3) The k-feature set problem is W[2]-complete
by C. Cotta and P. Moscato,
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
67(4):686-690, 2003
4) Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data
Carlos Cotta, Christian Sloper and Pablo Moscato
Applications of Evolutionary Computing
Lecture Notes in Computer Science, 2004,
Volume 3005/2004, 21-30, DOI: 10.1007/978-3-540-24653-4_3
http://www.springerlink.com/content/w9xplww39wllvn6d/
5) The Parameterized Complexity of Multiparent Recombination,
C. Cotta and P. Moscato, Proceedings of MIC2005, Vienna, Austria, pp. 237-241, (2005)
http://www.lcc.uma.es/~ccottap/papers/mic05multiparent.pdf
6) Complexity Aspects of Image Classification, in
Medical Imaging and Informatics
Lecture Notes in Computer Science, 2008,
Volume 4987/2008, 1-4, DOI: 10.1007/978-3-540-79490-5_1
http://www.springerlink.com/content/t47xp2h46352481m/
