Pages that link to "Item:Q1403765"
From MaRDI portal
The following pages link to Ant colony search algorithms for optimal polygonal approximation of plane curves. (Q1403765):
Displaying 14 items.
- Polygonal approximation using integer particle swarm optimization (Q506726) (← links)
- A discrete geometry approach for dominant point detection (Q609167) (← links)
- Polygonal approximation of closed discrete curves (Q866695) (← links)
- An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) (Q929430) (← links)
- On the Farey sequence and its augmentation for applications to image analysis (Q1676209) (← links)
- Image vectorization and colors reduction with ant colony optimization (Q1677341) (← links)
- Data reduction of large vector graphics (Q1765582) (← links)
- Automatic segmentation of metaphase cells based on global context and variant analysis (Q2384943) (← links)
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique (Q2467428) (← links)
- Ant colony optimization for the nonlinear resource allocation problem (Q2489380) (← links)
- Implementation of edge linking by ant colony algorithm (Q2911385) (← links)
- Approximate geodesic calculation based on an ant colony iterative algorithm (Q3194513) (← links)
- A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test (Q3643081) (← links)
- Digital Straightness, Circularity, and Their Applications to Image Analysis (Q4648755) (← links)
