Evolutionary optimization of NP-hard problem instances

Evolutionary optimization of NP-hard problem instances

Justin Shenk

Justin Shenk

Osnabrück, Lower Saxony

A genetic algorithm approach to graph partitioning

Artificial Intelligence

Description

Genetic algorithms can be used for optimizing parameters of a graph partition and allow informed problem-specific mutation functions. NP-hard problems like 3SAT provide opportunity for optimizing genetic algorithms by generating random problems which can be used for feature discovery of graph partitioning solutions. Using this model, the probability of hardness of 3SAT can be defined by selecting problems for phase transition topography. This project aims to use Intel Math Kernel Library for Python and Numpy implementations benchmarked against native Python and Numpy for performance comparison.

Justin

Justin S. added photos to project Evolutionary optimization of NP-hard problem instances

Medium cbf1371b 3053 4731 ae43 b2e83c908eb4

Evolutionary optimization of NP-hard problem instances

Genetic algorithms can be used for optimizing parameters of a graph partition and allow informed problem-specific mutation functions. NP-hard problems like 3SAT provide opportunity for optimizing genetic algorithms by generating random problems which can be used for feature discovery of graph partitioning solutions. Using this model, the probability of hardness of 3SAT can be defined by selecting problems for phase transition topography. This project aims to use Intel Math Kernel Library for Python and Numpy implementations benchmarked against native Python and Numpy for performance comparison.

Medium justin

Justin S. created project Evolutionary optimization of NP-hard problem instances

Medium cbf1371b 3053 4731 ae43 b2e83c908eb4

Evolutionary optimization of NP-hard problem instances

Genetic algorithms can be used for optimizing parameters of a graph partition and allow informed problem-specific mutation functions. NP-hard problems like 3SAT provide opportunity for optimizing genetic algorithms by generating random problems which can be used for feature discovery of graph partitioning solutions. Using this model, the probability of hardness of 3SAT can be defined by selecting problems for phase transition topography. This project aims to use Intel Math Kernel Library for Python and Numpy implementations benchmarked against native Python and Numpy for performance comparison.

No users to show at the moment.

Bigger 0 17h0cidt6oijn3mpfqjj9z2q5bgjnt8sqljyqgatbbcgns v5djg wsn9fmjlsmpcpjy6f2a5gi4nkizixlkh4ut giznktmixljvik bbtlnfiri8tpx mfca
  • Projects 0
  • Followers 1

Suwon HAM

39 Rue Volta, 75003 Paris, France