نتایج جستجو برای: based algorithms
تعداد نتایج: 3115297 فیلتر نتایج به سال:
clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. k-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. in recent years, several algorithms are provided based on evolutionary algorithms for cluster...
a new structure learning approach for bayesian networks (bns) based on asexual reproduction optimization (aro) is proposed in this letter. aro can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. in aro, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survi...
image retrieval is an important research field which has received great attention in the last decades. in this paper, we present an approach for the image retrieval based on the combination of text-based and content-based features. for text-based features, keywords and for content-based features, color and texture features have been used. query in this system contains some keywords and an input...
Sponge structure is a structure widely used in the design of cryptographic algorithms that reduces the design of the algorithms to the design of a permutation or pseudo-random function. The development of sponge-based algorithms and the selection of designs based on this structure in SHA3 and CAESAR competitions increase the need to examine its security against various types of attacks. In the ...
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...
regarding the large number of developed particle swarm optimization (pso) algorithms and the various applications for which pso has been used, selecting the most suitable variant of pso for solving a particular optimization problem is a challenge for most researchers. in this paper, using a comprehensive survey and taxonomy on different types of pso, an expert system (es) is designed to identif...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید