 | Monter d'un niveau |
Belderrar, A., Kpodjedo, S., Guéhéneuc, Y.-G., Antoniol, G., & Galinier, P. (mars 2011). Sub-graph mining: Identifying micro-architectures in evolving object-oriented software [Communication écrite]. 15th European Conference on Software Maintenance and Reengineering (CSMR 2011), Oldenburg, Germany. Lien externe
Fadlaoui, K., & Galinier, P. (2011). A tabu search algorithm for the covering design problem. Journal of Heuristics, 17(6), 659-674. Lien externe
Galinier, P., Boujbel, Z., & Coutinho Fernandes, M. (2011). An efficient memetic algorithm for the graph partitioning problem. Annals of Operations Research, 191(1), 1-22. Lien externe
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2011). Using local search to speed up filtering algorithms for some NP-hard constraints. Annals of Operations Research, 184(1), 121-135. Lien externe
Kpodjedo, S., Ricca, F., Galinier, P., Guéhéneuc, Y.-G., & Antoniol, G. (2011). Design evolution metrics for defect prediction in object oriented systems. Empirical Software Engineering, 16(1), 141-175. Lien externe
Medini, S., Galinier, P., Di Penta, M., Guéhéneuc, Y.-G., & Antoniol, G. (septembre 2011). A fast algorithm to locate concepts in execution traces [Communication écrite]. 3rd International Symposium on Search Based Software Engineering (SSBSE 2011), Szeged, Hungary. Lien externe
