• Tidak ada hasil yang ditemukan

Conference paper

N/A
N/A
Protected

Academic year: 2017

Membagikan "Conference paper"

Copied!
4
0
0

Teks penuh

Loading

Gambar

Table 2: Clustering index values for the Test-1.
Figure 2: (a) Real-World Test Image, (b) Calinski-HarabaszStatistics of (a) (Optimum cluster number is 11).

Referensi

Garis besar

Dokumen terkait

stage. λ prevents tending to zero at the end of iteration algorithm. Search range of colony reduces gradually and production ability of hire bee strengthens gradually. Following

In this paper, to consider the spatial dependence between pixels and sub-pixels together, a new search strategy inspired by multi-objective memetic algorithm (Ong et al.,

First of all, the points belonging to the same object must be classified into one or several closed polygons. The algorithm chooses randomly one point and

In this paper, a dense matching algorithm based on Self-Adaptive Patch in view of urban scene have been accomplished and mesh simplification is achieved using

In this research, two meta-heuristic algorithms have been hybridized, namely, artificial bee colony (ABC) and Improved Simulated Annealing (SA), to solve the Capacitated

Dari hasil simulasi penempatan optimal SVC pada sistem transmisi 500 kV Jawa Bali menggunakan Artificial Bee Colony (ABC) Algorithm dapat ditarik kesimpulan,. Proses komputasi

Till now, several metaheuristic algorithms have been investigated to solve real-world combinatorial or global opti- mization problems such as Artificial Bee Colony ABC Karaboga and

Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization ACO, Bee Colony Optimization BCO, and Particle