A Multiagent Memetic Optimization Algorithm Based on Temporal Asymptotic Surprise in Complex Networks to Reveal the Structure of the Dynamic Community | Zendy

Somayeh Ranjkesh | Zendy; Behrooz Masoumi | Zendy; Seyyed Mohsen Hashemi | Zendy

Open Access

A Multiagent Memetic Optimization Algorithm Based on Temporal Asymptotic Surprise in Complex Networks to Reveal the Structure of the Dynamic Community

Author(s) -

Somayeh Ranjkesh,

Behrooz Masoumi,

Seyyed Mohsen Hashemi

Publication year - 2022

Publication title -

computational intelligence and neuroscience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.605

H-Index - 52

eISSN - 1687-5273

pISSN - 1687-5265

DOI - 10.1155/2022/6976875

Subject(s) - memetic algorithm , computer science , surprise , smoothing , complex network , variety (cybernetics) , function (biology) , optimization problem , limit (mathematics) , dynamic network analysis , algorithm , artificial intelligence , mathematical optimization , evolutionary algorithm , mathematics , psychology , social psychology , mathematical analysis , computer network , evolutionary biology , world wide web , computer vision , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research