Documents dont l'auteur est "Galinier, Philippe"

Grouper par: Auteurs ou autrices | Date de publication | Sous-type de document | Aucun groupement

Aller à : 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999

Nombre de documents: 55

2017

Galinier, P., Kpodjedo, S., & Antoniol, G. (juillet 2017). A penalty-based Tabu search for constrained covering arrays [Communication écrite]. 2017 annual Genetic and Evolutionary Computation Conference (GECCO 2017), Berlin, Germany. Lien externe

Wu, X., Lü, Z., & Galinier, P. (2017). Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks, 69(2), 222-236. Lien externe

2016

Lemamou, E. A., Galinier, P., & Chamberland, S. (2016). A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks. IEEE/ACM Transactions on Networking, 24(1), 137-148. Lien externe

2015

Correal, B., & Galinier, P. (2015). On the complexity of searching the linear ordering problem neighborhoods. Dans Evolutionary Computation in Combinatorial Optimization : 15th European Conference (EvoCOP 2015), 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings (Vol. 9026, p. 150-159). Lien externe

2014

Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2014). Automated generation of conjectures on forbidden subgraph characterization. Discrete Applied Mathematics, 162, 177-194. Lien externe

Bilal, N., Galinier, P., & Guibault, F. (2014). An iterated-tabu-search heuristic for a variant of the partial set covering problem. Journal of Heuristics, 20(2), 143-164. Lien externe

Kpodjedo, S., Galinier, P., & Antoniol, G. (2014). Using local similarity measures to efficiently address approximate graph matching. Discrete Applied Mathematics, 164, part, 161-171. Lien externe

2013

Galinier, P., Hamiez, J.-P., Hao, J.-K., & Porumbel, D. C. (2013). Recent Advances in Graph Vertex Coloring. Dans Zelinka, I., Snášel, V., & Abraham, A. (édit.), Handbook of Optimization: From Classical to Modern Approach (p. 505-528). Lien externe

Galinier, P., Lemamou, E., & Bouzidi, M. W. (2013). Applying Local Search to the Feedback Vertex Set Problem. Journal of Heuristics, 19(5), 797-818. Lien externe

Sonn, S., Bilodeau, G.-A., & Galinier, P. (juin 2013). Fast and accurate registration of visible and infrared videos [Communication écrite]. IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW 2013), Portland, OR, United states. Lien externe

Kpodjedo, S., Ricca, F., Galinier, P., Antoniol, G., & Guéhéneuc, Y.-G. (2013). MADMatch: Many-to-many approximate diagram matching for design comparison. IEEE Transactions on Software Engineering, 39(8), 1090-1111. Lien externe

Bilal, N., Galinier, P., & Guibault, F. (2013). A new formulation of the set covering problem for metaheuristic approaches. ISRN Operations Research, 2013, 10-10. Lien externe

Adjarath Lemamou, E., Chamberland, S., & Galinier, P. (2013). A reliable model for global planning of mobile networks. Computers & Operations Research, 40(10), 2270-2282. Lien externe

Kpodjedo, S., Ricca, F., Galinier, P., Antoniol, G., & Guéhéneuc, Y.-G. (2013). Studying Software Evolution of Large Object-Oriented Software Systems Using an ETGM Algorithm. Journal of Software: Evolution and Process, 25(2), 139-163. Lien externe

2012

Lapointe, M., Blondin Massé, A., Galinier, P., Lord, M., & Marcotte, O. (novembre 2012). Enumerating minimum feedback vertex sets in directed graphs [Communication écrite]. Bordeaux Graph Workshop, Bordeaux, France. Lien externe

Lemamou, E. A., Chamberland, S., & Galinier, P. (octobre 2012). A global planning model for survivable mobile networks [Communication écrite]. IEEE Conference Networks, Rome Italie. Lien externe

Guerrouj, L., Galinier, P., Guéhéneuc, Y.-G., Antoniol, G., & Di Penta, M. (octobre 2012). TRIS: A fast and accurate identifiers splitting and expansion algorithm [Communication écrite]. 19th Working Conference on Reverse Engineering (WCRE 2012), Kingston, ON, Canada. Lien externe

2011

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

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

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

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., 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

2010

Fadlaoui, K., & Galinier, P. (2010). Covering design problem constructed by using the TS-CD algorithm. (Rapport technique n° EPM-RT-2010-01). Disponible

Kpodjedo, S., Galinier, P., & Antoniol, G. (avril 2010). Enhancing a tabu algorithm for approximate graph matching by using similarity measures [Communication écrite]. 10th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2010), Istanbul, Turkey. Lien externe

Desrosiers, C., Galinier, P., Hertz, A., & Hansen, P. (2010). Improving constrained pattern mining with first-fail-based heuristics. Data Mining and Knowledge Discovery, 23(1), 1-28. Lien externe

Kpodjedo, S., Galinier, P., & Antoniol, G. (mars 2010). On the use of similarity metrics for approximate graph matching [Communication écrite]. International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet, Tunisia. Publié dans Electronic Notes in Discrete Mathematics, 36. Lien externe

2009

Kpodjedo, S., Ricca, F., Antoniol, G., & Galinier, P. (mai 2009). Evolution and search based metrics to improve defects prediction [Communication écrite]. 1st International Symposium on Search Based Software Engineering (SSBSE 2009), Windsor, Berkshire, United Kingdom. Lien externe

Kpodjedo, S., Ricca, F., Galinier, P., & Antoniol, G. (mars 2009). Recovering the evolution stable part using an ECGM algorithm: Is there a tunnel in Mozilla? [Communication écrite]. 13th European Conference on Software Maintenance and Reengineering (CSMR 2009), Kaiserslautern, Germany. Lien externe

Desrosiers, C., Galinier, P., Hertz, A., & Paroz, S. (2009). Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. Journal of Combinatorial Optimization, 18(2), 124-150. Lien externe

2008

Kpodjedo, S., Galinier, P., & Antoniol, G. (2008). A Google-inspired error-correcting graph matching algorithm. (Rapport technique n° EPM-RT-2008-06). Disponible

Galinier, P., Hertz, A., & Zufferey, N. (2008). An Adaptive Memory Algorithm for the K-Coloring Problem. Discrete Applied Mathematics, 156(2), 267-279. Lien externe

Del Grosso, C., Antoniol, G., Merlo, E., & Galinier, P. (2008). Detecting Buffer Overflow Via Automatic Test Input Data Generation. Computers & Operations Research, 35(10), 3125-3143. Lien externe

Desrosiers, C., Galinier, P., & Hertz, A. (2008). Efficient Algorithms for Finding Critical Subgraphs. Discrete Applied Mathematics, 156(2), 244-266. Lien externe

Kpodjedo, S., Ricca, F., Galinier, P., & Antoniol, G. (octobre 2008). Error correcting graph matching application to software evolution [Communication écrite]. 15th Working Conference on Reverse Engineering (WCRE 2008). Lien externe

Kpodjedo, S., Ricca, F., Galinier, P., & Antoniol, G. (novembre 2008). Not all classes are created equal: toward a recommendation system for focusing testing [Communication écrite]. International Workshop on Recommendation Systems for Software Engineering (RSSE 2008), Atlanta, Georgia. Lien externe

Ouellet, M.-O., Chamberland, S., & Galinier, P. (octobre 2008). On the planning problem of wireless local area networks with directional antennas [Communication écrite]. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications. Lien externe

Hyppolite, J.-M., Galinier, P., & Pierre, S. (2008). A Tabu Search Heuristic for the Routing and Wavelength Assignment Problem in Multigranular Optical Networks. Photonic Network Communications, 15(2), 123-130. Lien externe

Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (mai 2008). Using local search to speed up filtering algorithms for some NP-hard constraints [Communication écrite]. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France. Lien externe

2007

Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (août 2007). Improving frequent subgraph mining in the presence of symmetry [Communication écrite]. 5th International Workshop on Mining and Learning with Graphs, Firenze, Italia. Lien externe

Galinier, P., & Hertz, A. (2007). Solution Techniques for the Large Set Covering Problem. Discrete Applied Mathematics, 155(3), 312-326. Lien externe

2006

Galinier, P., & Hertz, A. (2006). A survey of local search methods for graph coloring. Computers & Operations Research, 33(9), 2547-2562. Lien externe

Galinier, P., & Jaumard, B. (2006). A tabu search algorithm for difference triangle sets and golomb rulers. Computers & Operations Research, 33(4), 955-970. Lien externe

2005

Del Grosso, C., Antoniol, G., Di Penta, M., Galinier, P., & Merlo, E. (juin 2005). Improving network applications security : a new heuristic to generate stress testing data [Communication écrite]. 2005 Annual Genetic and Evolutionary Computation Conference (GECCO 2005), Washington, D.C.. Lien externe

Galinier, P., Gendreau, M., Soriano, P., & Bisaillon, S. (2005). Solving the frequency assignment problem with polarization by local search and tabu. 4OR, 3(1), 59-78. Lien externe

Dzongang, C., Galinier, P., & Pierre, S. (2005). A tabu search heuristic for the routing and wavelength assignment problem in optical networks. IEEE Communications Letters, 9(5), 426-428. Lien externe

Dzongang, C., Galinier, P., & Pierre, S. (2005). Une heuristique taboue pour le routage et l'affectation de longueurs d'onde avec scénarios de panne. [A tabu heuristic for routing and wavelength assignment with failure scenarios]. Annales des télécommunications, 60(9-10), 1140-1160. Lien externe

2004

Galinier, P., & Hao, J.-K. (2004). A general approach for constraint solving by local search. Journal of Mathematical Modelling and Algorithms, 3(1), 73-88. Lien externe

Dzongang, C. F., Galinier, P., & Pierre, S. (mars 2004). A tabu search approach for routing and wavelength assignment in optical networks [Communication écrite]. Workshop on Optimization of Optical Networks, Montréal, Québec. Non disponible

2003

Bourdais, S., Galinier, P., & Pesant, G. (septembre 2003). HIBISCUS: a constraint programming application to staff scheduling in health care [Communication écrite]. 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland. Lien externe

2002

Galinier, P., Hertz, A., & Zufferey, N. (janvier 2002). Adaptative memory algorithms for graph coloring [Communication écrite]. Computational Symposium on Graph Coloring and Generalizations (COLOR 2002), Ithaca,US. Non disponible

2001

Galinier, P., Jaumard, B., Morales, R., & Pesant, G. (janvier 2001). Constraint-based approach to the Golomb ruler problem [Communication écrite]. 3rd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001), Ashford, UK. Non disponible

2000

Galinier, P., & Hao, J. K. (janvier 2000). General approach for constraint solving by socal search [Communication écrite]. 2nd International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2000), Paderborn, Germany. Non disponible

1999

Galinier, P., & Hao, J. K. (1999). Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4), 379-397. Lien externe

Hao, J. K., Galinier, P., & Habib, M. (1999). Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes. Revue d'intelligence artificielle, 13(2), 283-324. Non disponible

Liste produite: Fri Dec 20 04:09:34 2024 EST.

Pour citer ou exporter	Atom RSS 1.0 RSS 2.0