نتایج جستجو برای: heuristic method

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

Journal: :JASIST 2005
Christopher C. Yang Kar Wing Li

The authors propose a heuristic method for Chinese automatic text segmentation based on a statistical approach. This method is developed based on statistical information about the association among adjacent characters in Chinese text. Mutual information of bi-grams and significant estimation of tri-grams are utilized. A heuristic method with six rules is then proposed to determine the segmentat...

Journal: :International Journal of Hybrid Information Technology 2017

Journal: :Journal of clinical and nursing research 2023

There is an old saying, “Give a man fish, and he will eat for day. Teach to the rest of his life.” In clinical teaching, students should not only be taught about diseases, but their intelligence also cultivated, along with analytical, comprehension, independent learning skills. The ability solve problems enables think independently acquire knowledge. This known as heuristic method teaching. thi...

Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...

Journal: :journal of advances in computer engineering and technology 0
azita yousefi payame noor university,tehran,iran. bita amirshahi payame noor university,tehran.iran

abstract— in this paper we have tried to develop an altered version of the artificial bee colony algorithm which is inspired from and combined with the meta-heuristic algorithm of firefly. in this method, we have tried to change the main equation of searching within the original abc algorithm. on this basis, a new combined equation was used for steps of employed bees and onlooker bees. for this...

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

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

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