You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This project proposes an efficient memetic algorithm for the graph coloring problem. Authors : L. Moalic (laurent.moalic@uha.fr) and A. Gondran (alexandre.gondran@enac.fr). Details are presented in the paper "Variations on memetic algorithms for graph coloring problems" :
Code related to the article "Reducing domain shift in synthetic data augmentation for semantic segmentation of 3D point clouds" submitted to the SMC 2022 conference