نتایج جستجو برای Heuristic Algorithm

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

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

2002
Tomás Müller,

In this paper we present a hybrid heuristic search algorithm for constraint satisfaction problems. This algorithm was proposed as a mixture of two basic approaches: local search and backtrack based search. One of its major advantages is interactive behaviour in the sense of changing the task during the search. We present the results using the well known n-queens problem.

1996
Chengwen Liu, Hao Chen,

This paper describes an improvement on a Partition and Replicate Strategy (PRS) for distributed query processing in a multi-database environment in which relations are unfragmented and replicated. For a given set of relations to be partitioned, determining the optimal copies of the relations to be partitioned is NP-hard. A heuristic algorithm is proposed. Our experimental results show that the ...

2000
Keyun Hu, Lili Diao, Yuchang Lu, Chunyi Shi,

Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining, In this paper, we propose a heuristic reduct finding algorithm, which is based on frequencies of attributes appeared in discernibility matrix. Our method does not guarantee to find optimal reduct, but experiment shows that in most situations it doe...

Journal: :CoRR 2013
Jakub Kowalski, Marek Szykula,

We present a new heuristic algorithm finding reset words. The algorithm called CutOff-IBFS is based on a simple idea of inverse breadth-first-search in the power automaton. We perform an experimental investigation of effectiveness compared to other algorithms existing in literature, which yields that our method generally finds a shorter word in an average case and works well in practice.

A. Kaveh, A. Zolghadr,

This paper presents a novel population-based meta-heuristic algorithm inspired by the game of tug of war. Utilizing a sport metaphor the algorithm, denoted as Tug of War Optimization (TWO), considers each candidate solution as a team participating in a series of rope pulling competitions.  The  teams  exert  pulling  forces  on  each  other...

M. Danesh, M. Jalilkhani,

This study is devoted to discrete sizing optimization of truss structures employing an efficient discrete evolutionary meta-heuristic algorithm which uses the Newton gradient-based method as its updating scheme and it is named here as Newton Meta-heuristic Algorithm (NMA). In order to enable the NMA population-based meta-heuristic to effectively explore the discrete design space, a term contain...

Emre Tüncel, Harun Res¸it Yazgan, Sena Kır,

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

M. Ardalan Asl, S. Asil Gharebaghi,

A new meta-heuristic method, based on Neuronal Communication (NC), is introduced in this article. The neuronal communication illustrates how data is exchanged between neurons in neural system. Actually, this pattern works efficiently in the nature. The present paper shows it is the same to find the global minimum. In addition, since few numbers of neurons participate in each step of the method,...

Mani Sharifi, Mehdi Yazdani, Mohammad Jafar Tarokh, Mohammad Navid Mokhtarian,

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

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

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