The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Modelling of a database performance depending on numerous factors is the first step towards its optimization. The linear regression model with optional parameters was created. Regression equation coefficients are optimized with the Flower Pollination metaheuristic algorithm. The algorithm is executed with numerous possible execution parameter combinations and results are discussed. Potential obstacles...
Dividing a dataset into disjoint groups of homogeneous structure, known as data clustering, constitutes an important problem of data analysis. It can be solved with broad range of methods employing statistical approaches or heuristic procedures. The latter often include mechanisms known from nature as they are known to serve as useful components of effective optimizers. The paper investigates the...
This paper describes the use of a new swarm-based metaheuristic, namely Krill Herd Algorithm (KHA), in computer gaming. In this work, KHA is employed to find a bots movement strategy in a computer racing game. The complete algorithm is implemented using a Unity Engine in C# language. Herein, the triggering of the metaheuristic optimization task was conducted by the way of a KHA internal parameter...
This paper describes a new approach to metaheuristic-based data clustering by means of Krill Herd Algorithm (KHA). In this work, KHA is used to find centres of the cluster groups. Moreover, the number of clusters is set up at the beginning of the procedure, and during the subsequent iterations of the optimization algorithm, particular solutions are evaluated by selected validity criteria. The proposed...
In recent times, several new metaheuristic algorithms based on natural phenomena have been made available to researchers. One of these is that of the Krill Herd Algorithm (KHA) procedure. It contains many interesting mechanisms. The purpose of this article is to compare the KHA optimization algorithm used for learning an artificial neural network (ANN), with other heuristic methods and with more conventional...
This paper describes the basic components of a research project aimed at the application of natural computing metaheuristics to optimize the horizontal scaling of databases. Column oriented databases were selected for the project because of their unique properties. A mathematical model has been created in order to align the problem of horizontal scalability to the general optimization methods, such...
Zaprezentowano istotę systemu eksploatacji oraz koncepcję modelu symulacyjnego, który ma być wykorzystywany do optymalizacji procesu odstawy urobku z oddziału wydobywczego (uwzględniając operacje: załadunku urobku, odstawy oponowej do punktu wysypu urobku na przenośnik taśmowy zabudowany w bezpośrednim okonturowaniu złoża) w systemach eksploatacji stosowanych w kopalniach KGHM „Polska Miedź” SA. Model...
W ramach pracy należało wykonać badania modelowe rury polipropylenowej wzmocnionej włóknem szklanym w osnowie żywicy epoksydowej, których celem było znalezienie optymalnego kąta ułożenia włókien w poszczególnych warstwach laminatu. Badania te przeprowadzono metodą elementów skończonych w programie I-DEAS. Optymalizację wzmocnienia kompozytowego rury polipropylenowej (linera) przeprowadzono ze względu...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.