Efficient Web Service Composition via Knapsack-Variant Algorithm.
Shi-Liang FanYubin YangPublished in: CoRR (2018)
Keyphrases
- dynamic programming
- web service composition
- learning algorithm
- np hard
- cost function
- discrete particle swarm optimization
- knapsack problem
- computationally efficient
- optimal solution
- computational complexity
- multi agent systems
- simulated annealing
- objective function
- optimization algorithm
- artificial intelligence
- search space
- state space
- particle swarm optimization
- optimization method
- case study
- solution quality
- web services