Efficient Web Service Composition via Knapsack-Variant Algorithm.
Shi-Liang FanYu-Bin YangXiao-Xuan WangPublished in: SCC (2018)
Keyphrases
- dynamic programming
- web service composition
- discrete particle swarm optimization
- optimal solution
- cost function
- np hard
- objective function
- computational efficiency
- computationally efficient
- learning algorithm
- knapsack problem
- computational complexity
- response time
- software engineering
- optimization algorithm
- search space
- packing problem
- ai planning