An efficient two-step algorithm for the incompressible flow problem.
Pengzhan HuangXinlong FengYinnian HePublished in: Adv. Comput. Math. (2015)
Keyphrases
- dynamic programming
- search space
- significant improvement
- detection algorithm
- computationally efficient
- improved algorithm
- simulated annealing
- worst case
- experimental evaluation
- highly efficient
- segmentation algorithm
- np hard
- k means
- times faster
- selection algorithm
- linear programming
- particle swarm optimization
- cost function
- level set
- learning algorithm
- post processing
- computational cost
- clustering method
- tree structure
- path planning
- fully automatic
- preprocessing
- memory requirements
- data structure
- optimal solution
- objective function