Parallel error tolerance scheme based on the hill climbing nature of simulated annealing

Author(s):  
C.-E. Hong ◽  
B.M. McMillin
Author(s):  
Laith Mohammad Abualigah ◽  
Essam Said Hanandeh ◽  
Ahamad Tajudin Khader ◽  
Mohammed Abdallh Otair ◽  
Shishir Kumar Shandilya

Background: Considering the increasing volume of text document information on Internet pages, dealing with such a tremendous amount of knowledge becomes totally complex due to its large size. Text clustering is a common optimization problem used to manage a large amount of text information into a subset of comparable and coherent clusters. Aims: This paper presents a novel local clustering technique, namely, β-hill climbing, to solve the problem of the text document clustering through modeling the β-hill climbing technique for partitioning the similar documents into the same cluster. Methods: The β parameter is the primary innovation in β-hill climbing technique. It has been introduced in order to perform a balance between local and global search. Local search methods are successfully applied to solve the problem of the text document clustering such as; k-medoid and kmean techniques. Results: Experiments were conducted on eight benchmark standard text datasets with different characteristics taken from the Laboratory of Computational Intelligence (LABIC). The results proved that the proposed β-hill climbing achieved better results in comparison with the original hill climbing technique in solving the text clustering problem. Conclusion: The performance of the text clustering is useful by adding the β operator to the hill climbing.


2019 ◽  
Vol 157 ◽  
pp. 229-237
Author(s):  
Tri Handhika ◽  
Achmad Fahrurozi ◽  
Revaldo Ilfestra Metzi Zen ◽  
Dewi Putrie Lestari ◽  
Ilmiyati Sari ◽  
...  

2018 ◽  
Vol 13 (3) ◽  
pp. 25 ◽  
Author(s):  
Alexander S. Bratus ◽  
Yuri S. Semenov ◽  
Artem S. Novozhilov

Sewall Wright’s adaptive landscape metaphor penetrates a significant part of evolutionary thinking. Supplemented with Fisher’s fundamental theorem of natural selection and Kimura’s maximum principle, it provides a unifying and intuitive representation of the evolutionary process under the influence of natural selection as the hill climbing on the surface of mean population fitness. On the other hand, it is also well known that for many more or less realistic mathematical models this picture is a severe misrepresentation of what actually occurs. Therefore, we are faced with two questions. First, it is important to identify the cases in which adaptive landscape metaphor actually holds exactly in the models, that is, to identify the conditions under which system’s dynamics coincides with the process of searching for a (local) fitness maximum. Second, even if the mean fitness is not maximized in the process of evolution, it is still important to understand the structure of the mean fitness manifold and see the implications of this structure on the system’s dynamics. Using as a basic model the classical replicator equation, in this note we attempt to answer these two questions and illustrate our results with simple well studied systems.


2019 ◽  
Vol 12 (4) ◽  
pp. 153-170 ◽  
Author(s):  
Guefrouchi Ryma ◽  
Kholladi Mohamed-Khireddine

Meta-heuristics are used as a tool for ontology mapping process in order to improve their performance in mapping quality and computational time. In this article, ontology mapping is resolved as an optimization problem. It aims at optimizing correspondences discovery between similar concepts of source and target ontologies. For better guiding and accelerating the concepts correspondences discovery, the article proposes a meta-heuristic hybridization which incorporates the Hill Climbing method within the mutation operator in the genetic algorithm. For test concerns, syntactic and lexical similarities are used to validate correspondences in candidate mappings. The obtained results show the effectiveness of the proposition for improving mapping performances in quality and computational time even for large OAEI ontologies.


2017 ◽  
Vol 35 (2) ◽  
pp. 153-159
Author(s):  
Yasuyuki Yamada ◽  
Ryoichi Higashi ◽  
Gen Endo ◽  
Taro Nakamura

2014 ◽  
Vol 31 (4) ◽  
pp. 347-351 ◽  
Author(s):  
We-Sub Eom ◽  
Joo-Hee Lee ◽  
Hyun-Cheol Gong ◽  
Gi-Hyuk Choi

2010 ◽  
Vol 8 (2) ◽  
pp. 1-16
Author(s):  
Fatma Abd El-Sattar Omara

The scheduling of multiple interacting tasks of a single parallel program is considered the most important issue to exploit the true performance of the multiprocessor system. The problem is to find a schedule that will minimize the execution time (Make_Span) of a program. On the other hand, task scheduling on a multiprocessor system with and without communication delays is known to be NP-complete problem. Consequently, many heuristic algorithms have been developed, each of which may find optimal scheduling under different circumstances. One of the well known iterative algorithms is the hill-climbing. This algorithm starts with a complete solution and searches to improve this solution by choosing a better neighbor based on a cost function. This will lead to a local optimum which is considered the main drawback of this algorithm. The research in this study concerns to develop an efficient iterative algorithm for scheduling problem based on the hill-climbing. Present algorithm satisfies a local optimum that is very close to the global one in a reasonable amount of time. In most experiments, it satisfies the actual global optimum.


Sign in / Sign up

Export Citation Format

Share Document