Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "ANT" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
Ant Algorithm for Flow Assignment in Connection-oriented Networks
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/911137.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm mrówkowy
przypisanie przepływu
sieć komputerowa
ant algorithms
flow assignment
computer networks
Opis:
This work introduces ANB (Ant Algorithm for Non-Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use of ant algorithms in the assignment of static flows in connection-oriented networks. We analyze the major characteristics of the ANB and try to explain its performance. We report results of many experiments over various networks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 2; 205-220
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant-based extraction of rules in simple decision systems over ontological graphs
Autorzy:
Pancerz, K.
Lewicki, A.
Tadeusiewicz, R.
Powiązania:
https://bibliotekanauki.pl/articles/330276.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
ant based clustering
decision system
DRSA
ontological graphs
rule extraction
system decyzyjny
grafy ontologiczne
ekstrakcja reguł
Opis:
In the paper, the problem of extraction of complex decision rules in simple decision systems over ontological graphs is considered. The extracted rules are consistent with the dominance principle similar to that applied in the dominance-based rough set approach (DRSA). In our study, we propose to use a heuristic algorithm, utilizing the ant-based clustering approach, searching the semantic spaces of concepts presented by means of ontological graphs. Concepts included in the semantic spaces are values of attributes describing objects in simple decision systems.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 2; 377-387
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An ant-based filtering random-finite-set approach to simultaneous localization and mapping
Autorzy:
Li, D.
Zhu, J.
Xu, B.
Lu, M.
Li, M.
Powiązania:
https://bibliotekanauki.pl/articles/329854.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
simultaneous localization
simultaneous mapping
random finite set
probability hypothesis density
ant colony
lokalizacja jednoczesna
mapowanie jednoczesne
algorytm mrówkowy
Opis:
Inspired by ant foraging, as well as modeling of the feature map and measurements as random finite sets, a novel formulation in an ant colony framework is proposed to jointly estimate the map and the vehicle trajectory so as to solve a feature-based simultaneous localization and mapping (SLAM) problem. This so-called ant-PHD-SLAM algorithm allows decomposing the recursion for the joint map-trajectory posterior density into a jointly propagated posterior density of the vehicle trajectory and the posterior density of the feature map conditioned on the vehicle trajectory. More specifically, an ant-PHD filter is proposed to jointly estimate the number of map features and their locations, namely, using the powerful search ability and collective cooperation of ants to complete the PHD-SLAM filter time prediction and data update process. Meanwhile, a novel fast moving ant estimator (F-MAE) is utilized to estimate the maneuvering vehicle trajectory. Evaluation and comparison using several numerical examples show a performance improvement over recently reported approaches. Moreover, the experimental results based on the robot operation system (ROS) platform validate the consistency with the results obtained from numerical simulations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 505-519
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant-based clustering for flow graph mining
Autorzy:
Lewicki, Arkadiusz
Pancerz, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/330782.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
possibly certain sequences
flow graph
rough set
fuzzy set
ant based clustering
graf przepływu danych
zbiór przybliżony
zbiór rozmyty
Opis:
The paper is devoted to the problem of mining graph data. The goal of this process is to discover possibly certain sequences appearing in data. Both rough set flow graphs and fuzzy flow graphs are used to represent sequences of items originally arranged in tables representing information systems. Information systems are considered in the Pawlak sense, as knowledge representation systems. In the paper, an approach involving ant based clustering is proposed. We show that ant based clustering can be used not only for building possible large groups of similar objects, but also to build larger structures (in our case, sequences) of objects to obtain or preserve the desired properties.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 3; 561-572
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies