نتایج جستجو برای: a genetic algorithm based on non
تعداد نتایج: 16529402 فیلتر نتایج به سال:
the present study is an attempt to investigate the potential impact of inspirational quotes on improving english abstract vocabulary recall. to achieve this goal, a multiple choice language proficiency test of 60 items including vocabulary and grammar component was administered to a sample of 63 second-semester male and female students whose age ranged between 17 to 22 and they were studying en...
Power system stabilizers (PSSs) must be capable of providing appropriate stabilization signals over abroad range of operating conditions and disturbances. The main idea of this paper is changing aclassic PSS (CPSS) to an adaptive PSS using genetic algorithm. This new genetic algorithm based onadaptive PSS (GAPSS) improves power system damping, considerably. The controller design issue isformula...
The use of artificial intelligence in the process of diagnosing heart disease has been considered by researchers for many years. In this paper, an efficient method for selecting appropriate features extracted from electrocardiogram (ECG) signals, based on a genetic algorithm for use in an ensemble multi-kernel support vector machine classifiers, each of which is based on an optimized genetic al...
Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...
potato image segmentation is an important part of image-based potato defect detection. this paper presents a robust potato color image segmentation through a combination of a fuzzy rule based system, an image thresholding based on genetic algorithm (ga) optimization and morphological operators. the proposed potato color image segmentation is robust against variation of background, distance and ...
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
this paper uses integrated data envelopment analysis (dea) models to rank all extreme and non-extreme efficient decision making units (dmus) and then applies integrated dea ranking method as a criterion to modify genetic algorithm (ga) for finding pareto optimal solutions of a multi objective programming (mop) problem. the researchers have used ranking method as a shortcut way to modify ga to d...
this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید