نتایج جستجو برای: الگوریتم تطبیقی hill climbing
تعداد نتایج: 65725 فیلتر نتایج به سال:
The combination of the broad problem searching capabilities of a genetic algorithm with the local maxima location capabilities of a hill climbing algorithm can be a powerful technique for solving classification problems. Producing a number of specialist artificial neural networks, each an expert on one category, can be beneficial when solving problems in which the categories are distinct. This ...
In this paper, we aim at evaluating the impact of the starting point of a basic local search based on the first improvement strategy. We define the coverage rate of a configuration as the proportion of the search space from which a particular configuration can be reached by a strict hill-climbling with a non-zero probability. In particular, we compute the coverage rate of fitness landscapes glo...
It is generally believed that good modularization of software leads to systems which are easier to design, develop, test, maintain and evolve [1]. Software clustering using search–based techniques has been well studied using a hill climbing approach [2,4,5,6]. Hill climbing suffers from the problem of local optima, so some improvement may be expected by by considering more sophisticated search-...
The up-link bandwidth in satellite networks and in advanced traffic wireless information system is very limited. A server broadcasts data files provided by different independent providers and accessed by many clients in a round-robin manner. The clients who access these files may have different patterns of access. Some clients may wish to access several files in any order (AND), some wish to ac...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید