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" :
☆13Jun 27, 2018Updated 8 years ago
Alternatives and similar repositories for HEAD
Users that are interested in HEAD are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Using 3 ways to solve the problem: Tabu Search, Hybrid Evolutionary Algorithms and HEA in Duet.☆14Apr 1, 2019Updated 7 years ago
- Collection of datasets for network research.☆15Jul 26, 2020Updated 5 years ago
- A Boolean Algebra for Genetic Variants☆14Jun 25, 2026Updated last week
- A python package for finding causal functional connectivity from neural time series observations.☆19Jun 19, 2026Updated last week
- A collection of research papers related to graph structure learning(GSL).☆16Oct 11, 2022Updated 3 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- algorithm for study: multi-layer-perceptron, cluster-graph, cnn, rnn, restricted boltzmann machine, bayesian network☆24Aug 27, 2017Updated 8 years ago
- This repository contains the official implementation of the paper "Reliable Graph Neural Networks via Robust Aggregation" (NeurIPS, 2020)…