Metaheuristic assemblers of DNA strands: Noiseless and noisy cases G Minetti, E Alba IEEE Congress on Evolutionary Computation, 1-8, 2010 | 32 | 2010 |
Seeding strategies and recombination operators for solving the DNA fragment assembly problem G Minetti, E Alba, G Luque Information Processing Letters 108 (3), 94-100, 2008 | 29 | 2008 |
SAX: a new and efficient assembler for solving DNA Fragment Assembly Problem GF Minetti, G Leguizamón, E Alba XIII Argentine Symposium on Artificial Intelligence (ASAI 2012)(XLI JAIIO …, 2012 | 18 | 2012 |
An improved trajectory-based hybrid metaheuristic applied to the noisy DNA fragment assembly problem G Minetti, G Leguizamón, E Alba Information Sciences 277, 273-283, 2014 | 16 | 2014 |
Hybrid simulated annealing for optimal cost instrumentation in chemical plants J Hernández, C Salto, G Minetti, M Carnero, MC Sanchez Italian Association of Chemical Engineering, 2019 | 13 | 2019 |
Variable size population in parallel evolutionary algorithms GF Minetti, HA Alfonso 5th International Conference on Intelligent Systems Design and Applications …, 2005 | 12 | 2005 |
SA to optimize the multi-period water distribution network design C Bermudez, C Salto, GF Minetti XXIV Congreso Argentino de Ciencias de la Computación (La Plata, 2018)., 2018 | 10 | 2018 |
Designing a multi-period water distribution network with a hybrid simulated annealing C Bermudez, C Salto, GF Minetti XX Simposio Argentino de Inteligencia Artificial (ASAI 2019)-JAIIO 48 (Salta), 2019 | 9 | 2019 |
A new hybrid SA for solving the DNA fragment assembly problem G Minetti, G Luque, G Leguizamón, E Alba XXVIII Internacional Conference of the Chilean Computing Science Society …, 2009 | 9 | 2009 |
The problem aware local search algorithm: an efficient technique for permutation-based problems GF Minetti, G Luque, E Alba Soft Computing 21, 5193-5206, 2017 | 8 | 2017 |
A new strategy for adapting the mutation probability in genetic algorithms N Stark, GF Minetti, C Salto XVIII Congreso Argentino de Ciencias de la Computación, 2012 | 8 | 2012 |
Variable neighborhood search as genetic algorithm operator for DNA fragment assembling problem G Minetti, G Luque, E Alba 2008 Eighth International Conference on Hybrid Intelligent Systems, 714-719, 2008 | 8 | 2008 |
Solving the multi-period water distribution network design problem with a hybrid simulated anealling C Bermudez, C Salto, G Minetti Computer Science–CACIC 2018: 24th Argentine Congress, Tandil, Argentina …, 2019 | 7 | 2019 |
Developing genetic algorithms using different mapreduce frameworks: Mpi vs. hadoop C Salto, G Minetti, E Alba, G Luque Advances in Artificial Intelligence: 18th Conference of the Spanish …, 2018 | 7 | 2018 |
Variable neighborhood search for solving the DNA fragment assembly problem E Alba, G Luque, G Minetti Anales del XIII Congreso Argentino de Ciencias de la Computacin (CACIC …, 2007 | 6 | 2007 |
Improving evolutionary algorithms performance by extending incest prevention H Alfonso, P Cesan, N Fernandez, GF Minetti, C Salto, L Velazco, ... IV Congreso Argentina de Ciencias de la Computación, 1998 | 6 | 1998 |
Hybrid simulated annealing to optimize the water distribution network design: a real case C Bermudez, H Alfonso, G Minetti, C Salto Argentine Congress of Computer Science, 19-34, 2020 | 5 | 2020 |
A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem GF Minetti, C Salto, H Alfonso, RH Gallard VI Congreso Argentino de Ciencias de la Computación, 2000 | 5 | 2000 |
Combining incest prevention and multiplicity in evolutionary algorithms GF Minetti, C Salto, H Alfonso, RH Gallard V Congreso Argentino de Ciencias de la Computación, 1999 | 5 | 1999 |
Optimal instrumentation: Adjustment and hybridization of a simulated annealing based technique JL Hernández, C Salto, GF Minetti, M Carnero, C Bermudez, M Sánchez XXV Congreso Argentino de Ciencias de la Computación (CACIC)(Universidad …, 2019 | 4 | 2019 |