Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time

Keyphrases

• Polynomial Time 100%
• Evolutionary Algorithms 100%
• Pseudo-Boolean Function 100%
• Hamming Sphere 100%
• Problem Size 50%
• Search Space 50%
• Search Algorithm 50%
• Cardinality 50%
• Local Search Algorithm 50%
• Adjacency 50%
• Hamming Space 50%
• Expected Fitness 50%
• Promising Region 50%

Computer Science

• Polynomial Time 100%
• Boolean Function 100%
• Evolutionary Algorithm 100%
• Search Space 50%
• Local Search Algorithm 50%
• Cardinality 50%