( en | de | ru )

 

Disambiguation of "Stefano, Gabriele Di"

Author of the publication

copydeleteadd this publication to your clipboard
Different Genetic Algorithms and the Evolution of Specialization: A Study with Groups of Simulated Neural Robots.

, , , and . Artificial Life, 19 (2): 221--253 (2013)
DOI: 10.1162/ARTL_a_00106

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrea Di Stefano

Stefano Di Renzo

Pietro Di Stefano

Pietro Di Stefano

Stefano Meini

 

Other publications of authors with the same name

How to Gather Asynchronous Oblivious Robots on Anonymous Rings., , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 326-340. Springer, (2012)Optimal Gathering of Oblivious Robots in Anonymous Graphs., and . SIROCCO, volume 8179 of Lecture Notes in Computer Science, page 213-224. Springer, (2013)Graphs with Bounded Induced Distance., and . WG, volume 1517 of Lecture Notes in Computer Science, page 177-191. Springer, (1998)Dynamic Multi-level Overlay Graphs for Shortest Paths., , , , and . Math. Comput. Sci., 1 (4): 709-736 (2008)Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases., , , , and . J. Comb. Optim., 18 (3): 229-257 (2009)Mutual visibility in graphs.. Appl. Math. Comput., (2022)Gathering robots in graphs: The central role of synchronicity., , and . Theor. Comput. Sci., (2021)Maximum flow and minimum-cost flow in multi-interface networks., , and . ICUIMC, page 19. ACM, (2011)Bamboo Garden Trimming Problem: Priority Schedulings., , and . Algorithms, 12 (4): 74 (2019)A Fully Dynamic Algorithm for Distributed Shortest Paths., , , and . LATIN, volume 1776 of Lecture Notes in Computer Science, page 247-257. Springer, (2000)