Follow
Franco Mascia
Franco Mascia
Chargé de recherches of the F.R.S.-FNRS, IRIDIA, Université Libre de Bruxelles (ULB), Brussels, Belgium
Verified email at ulb.ac.be - Homepage
Title
Cited by
Cited by
Year
Reactive Search and Intelligent Optimization
R Battiti, M Brunato, F Mascia
Springer, 2008
4122008
AutoMoDe-Chocolate: automatic design of control software for robot swarms
G Francesca, M Brambilla, A Brutschy, L Garattoni, R Miletitch, G Podevijn, ...
Swarm Intelligence 9, 125-152, 2015
1092015
Cooperating local search for the maximum clique problem
W Pullan, F Mascia, M Brunato
Journal of Heuristics 17, 181-199, 2011
722011
Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
F Mascia, M López-Ibáńez, J Dubois-Lacoste, T Stützle
Computers & operations research 51, 190-199, 2014
692014
Automatic design of hybrid stochastic local search algorithms
ME Marmion, F Mascia, M López-Ibánez, T Stützle
Hybrid Metaheuristics: 8th International Workshop, HM 2013, Ischia, Italy …, 2013
572013
From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness
F Mascia, M López-Ibánez, J Dubois-Lacoste, T Stützle
Learning and Intelligent Optimization: 7th International Conference, LION 7 …, 2013
392013
Predicting structural and functional sites in proteins by searching for maximum-weight cliques
F Mascia, E Cilia, M Brunato, A Passerini
Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 1274-1279, 2010
252010
An algorithm portfolio for the sub-graph isomorphism problem
R Battiti, F Mascia
International Workshop on Engineering Stochastic Local Search Algorithms …, 2007
222007
Reactive and dynamic local search for max-clique: Engineering effective building blocks
R Battiti, F Mascia
Computers & Operations Research 37 (3), 534-542, 2010
182010
Cooperative strategies and reactive search: A hybrid model proposal
AD Masegosa, F Mascia, D Pelta, M Brunato
Learning and Intelligent Optimization: Third International Conference, LION …, 2009
182009
A template for designing single-solution hybrid metaheuristics
M López-Ibáńez, F Mascia, MÉ Marmion, T Stützle
Proceedings of the Companion Publication of the 2014 Annual Conference on …, 2014
162014
An analysis of parameter adaptation in reactive tabu search
F Mascia, P Pellegrini, M Birattari, T Stützle
International Transactions in Operational Research 21 (1), 127-152, 2014
142014
Tuning algorithms for tackling large instances: an experimental protocol
F Mascia, M Birattari, T Stützle
Learning and Intelligent Optimization: 7th International Conference, LION 7 …, 2013
122013
A non-adaptive stochastic local search algorithm for the chesc 2011 competition
F Mascia, T Stützle
International Conference on Learning and Intelligent Optimization, 101-114, 2012
122012
Reactive local search for maximum clique: A new implementation
R Battiti, F Mascia
University of Trento, 2007
122007
On the sensitivity of reactive tabu search to its meta-parameters
P Pellegrini, F Mascia, T Stützle, M Birattari
Soft computing 18, 2177-2190, 2014
112014
Reactive and dynamic local search for MAX-CLIQUE, does the complexity pay off?
R Battiti, F Mascia
University of Trento, 2006
72006
Automatic design of a hybrid iterated local search for the multi-mode resourceconstrained multi-project scheduling problem
M López-Ibánez, F Mascia, ME Marmion, T Stützle
Proceedings of the 6th Multidisciplinary International Scheduling Conference …, 2013
62013
AutoMoDe-Chocolate: A method for the automatic design of robot swarms that outperforms humans
G Francesca, M Brambilla, A Brutschy, L Garattoni, R Miletitch, G Podevijn, ...
Swarm Intelligence 9 (2-3), 125-152, 2015
52015
Algorithm comparison by automatically configurable stochastic local search frameworks: A case study using flow-shop scheduling problems
F Mascia, M López-Ibáńez, J Dubois-Lacoste, ME Marmion, T Stützle
Hybrid Metaheuristics: 9th International Workshop, HM 2014, Hamburg, Germany …, 2014
52014
The system can't perform the operation now. Try again later.
Articles 1–20