Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Orthogonal experimental design (OED) is a powerful method for identifying the best combination of factors, and considerably reduces the required number of experimental samples. Researchers have combined OED with evolutionary techniques, such as the genetic algorithm, particle swarm optimization, and artificial bee colony algorithm, resulting in significantly better performance. In this paper, we study...
To improve the accuracy and efficiency of facial expression classification, a facial expression recognition method using Gabor features and Adaboost classifiers is proposed. Local regions that best represent facial expressions are first segmented and located, and then the Gabor features of the local regions are extracted. Gabor features are selected by using distance discrimination and feature ranking,...
Ant colony optimization (ACO) is a kind of simulated evolutionary algorithm. It imitates ants' foraging process to find the shortest path, coexists with the characteristics of randomness and heuristic. It is applied successfully to solve combinatorial optimization problems, such as the TSP problem, the job-shop scheduling problem, etc. In practical application, ACO has the limitation of easily being...
Battle City, I believe we are not unfamiliar. Suppose such a rule: on the map there are total of n mine, white and black tanks; Within the specified time, who occupies most of mine will come to victory. Notice that, the tank is running automatically, not manually controlled. Obviously, an efficient AI which is the core of game determines game's outcome. How to occupy more mine in the shortest possible...
In order to lighten the burden of worknet and shorten the respond time of ISMBDI mode, a cache mechanism for ISMBDI mode is built, and correspondingly a new cache replacement policy LRAFU is presented. This policy well integrates the traditional cache replacement policies LRU (Least Recently Used) and LFU (Least Frequently Used), not only avoids the problem of cache pollution, fits the character of...
The traditional routing mechanism based on single path has become bottleneck which affects and restricts the performance of the whole network. Multi-next hop routing mechanism can implement packets forwarding in parallel, while preserves the best-effort model of the network layer. Multi-next hop technology can effectively ease the network congestion, increase resource utilization and enhance the network...
Parallel disk systems consume a significant amount of energy due to the large number of disks. To design economically attractive and environmentally friendly parallel disk systems, in this paper we design and evaluate an energy-aware prefetching strategy for parallel disk systems consisting of a small number of buffer disks and large number of data disks. Using buffer disks to temporarily handle requests...
The coverage problem is always important and difficult in WSN. This paper firstly analyzes the classical algorithm of the coverage-preserving nodes scheduling scheme (CPNSS) of the WSN. Then we propose a new improvement algorithm (NIA) which focuses on the problem of its low-efficiency and energy-imbalance. We divide all the nodes into several independent sets, and each set can cover all the area...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.