English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper an ant colony optimization (ACO) algorithm for the minimum  connected dominating set problem (MCDSP) is presented. The MCDSP become  increasingly important in recent years due to its applicability to the mobile  ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO  algorithm based on a known simple greedy algorithm that has a significant  drawback of being easily trapped in local optima. We have shown that by  adding a pheromone correction strategy and dedicating special attention to  the initial condition of the ACO algorithm this negative effect can be  avoided. Using this approach it is possible to achieve good results without  using the complex two-step ACO algorithm previously developed. We have tested  our method on standard benchmark data and shown that it is competitive to the  existing algorithms. [Projekat Ministarstva nauke Republike Srbije, br.  III-44006]

Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem