نتایج جستجو برای: effective algorithms

تعداد نتایج: 989589  

Journal: :Annales UMCS, Informatica 2004
Lukasz Machnik

Documents Clustering is a technique in which relationships between sets of documents are being automatically discovered and documents are divided into groups of similar specimens. The groups that are created during the process of clustering should be specified by the high degree of similarity between the elements that belong to the same group and low degree of similarity between the elements th...

Journal: :International Journal of Engineering & Technology 2018

Journal: :EAI Endorsed Transactions on e-Learning 2023

Computational linguistics is the branch of in which techniques computer science are applied to analysis and synthesis language speech. The main goals computational include: Text-to- speech conversion, Speech-to-text conversion Translating from one another. A part Linguistics Character recognition. recognition has been active challenging research areas field image processing pattern methodology ...

Journal: : 2022

Objectives. Integral equations have long been used in mathematical physics to demonstrate existence and uniqueness theorems for solving boundary value problems differential equations. However, despite integral a number of advantages comparison with corresponding where conditions are present the kernels equations, they rarely obtaining numerical solutions due presence dense matrices that arise w...

Journal: :International Journal of Data Mining & Knowledge Management Process 2013

Journal: :Journal of Parallel and Distributed Computing 1996

Journal: :International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2020

M. Momeni, M. Sarmadi , M. Yaghini,

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید