A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems

Keyphrases

• Interactive multimedia System 100%
• Multi-verse Optimizer 100%
• Multi-verse Optimization 100%
• 0-1 Knapsack Problem 100%
• Multi-verse Optimization Algorithm 66%
• Resource Allocation 33%
• Initialize 33%
• Local Optimum 33%
• Number of Iterations 33%
• Negative Value 33%
• Discretize 33%
• Real-world Problems 33%
• Best Solution 33%
• Multimedia Systems 33%
• Barrier Function 33%
• Infeasible Solution 33%
• Handling Constraints 33%
• Multidimensional Knapsack Problem 33%
• Knapsack 33%
• Repair Strategy 33%
• Tanh 33%
• Binary Hypothesis Testing 33%
• V-shaped Transfer Function 33%
• Adaptive multimedia 33%

Computer Science

• Optimization Algorithm 100%
• Multimedia Information System 100%
• Knapsack Problem 100%
• Knapsack 100%
• Interactive 100%
• Case Study 50%
• Resource Allocation 50%
• Real-World Problem 50%
• Transfer Function 50%
• Barrier Function 50%
• Tanh Activation Function 50%
• Negative Value 50%