Temat: Ant Diversity - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Study of Ant Faunal Diversity of Chintamoni Kar Bird Sanctuary, West Bengal, India
Autorzy:: Bhattacharjee, Samrat
Powiązania:: https://bibliotekanauki.pl/articles/1193615.pdf
Data publikacji:: 2017
Wydawca:: Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:: Ant Diversity
Chintamoni Kar Bird Sanctuary
Functional Groups
Premonsoon
Opis:: Ants are by far the most successful eusocial group of organisms. Present paper deals with ant survey in Chintamoni Kar Bird Sanctuary also called Narendrapur Bird Sanctuary, West Bengal, India. A total of 36 species under 18 genera and 6 subfamilies are recorded from the survey. Area A1 records maximum (27) species whereas area A7 records least (08) species. Premonsoon period of the year shows maximum ant activities and Subordinate Camponotini seems to be the predominant Functional group in the forest.
Źródło:: World Scientific News; 2017, 71; 28-42
2392-2192
Pojawia się w:: World Scientific News
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Population diversity in ant-inspired optimization algorithms
Autorzy:: Byrski, Aleksander
Węgrzyński, Krzysztof
Radwański, Wojciech
Starzec, Grażyna
Starzec, Mateusz
Bargiel, Monika
Urbańczyk, Aleksandra
Kisiel-Dorohinicki, Marek
Powiązania:: https://bibliotekanauki.pl/articles/2097962.pdf
Data publikacji:: 2021
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: ant colony optimization
diversity measuring
exploitation and exploration balance
metaheuristics
Opis:: Measuring the diversity in evolutionary algorithms that work in real-value search spaces is often computationally complex, but it is feasible; however, measuring the diversity in combinatorial domains is practically impossible. Nevertheless, in this paper we propose several practical and feasible diversitymeasurement techniques that are dedicated to ant colony optimization algorithms, leveraging the fact that we can focus on a pheromone table even though an analysis of the search space is at least an NP problem where the direct outcomes of the search are expressed and can be analyzed. Besides sketching out the algorithms, we apply them to several benchmark problems and discuss their efficacy.
Źródło:: Computer Science; 2021, 22 (3); 297-320
1508-2806
2300-7036
Pojawia się w:: Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja