1.

$4$-total mean cordial labeling of spider graph

صفحه 1-9
R Ponraj؛ S SUBBULAKSHMI؛ Prof.Dr M.Sivakumar

2.

Perfectionism Search Algorithm (PSA): An Efficient Meta-Heuristic Optimization Approach

صفحه 11-36
Amin Ghodousian؛ Mahdi Mollakazemiha؛ Noushin Karimian

3.

A new meta-heuristic algorithm of giant trevally for solving engineering problems

صفحه 37-51
Marjan Aliyari

4.

On some main parameters of stochastic processes on directed graphs

صفحه 53-65
Mehdi Shams؛ Gholamreza Hesamian

5.

Pair Difference Cordial Labeling of Double Alternate Snake Graphs

صفحه 67-77
R Ponraj؛ A Gayathri

6.

An attributed network embedding method to predict missing links in protein-protein interaction networks

صفحه 79-99
Ali Golzadeh؛ Ali Kamandi؛ Hossein Rahami

7.

Hybrid Filter-Wrapper Feature Selection using Equilibrium Optimization

صفحه 101-122
Mohammad Ansari Shiri؛ Najme Mansouri

8.

A Note on Change Point Analysis Using Filtering

صفحه 123-129
Reza Habibi

9.

Sequence pairs related to produced graphs from a method for dividing a natural number by two.

صفحه 131-140
Mohammad Zeynali Azim؛ Saeid Alikhani؛ Babak Anari؛ Bagher Zarei

10.

Using a New Strategy in Imperialist Competitive Algorithm to Solve Multi‑objective Problems (WSICA)

صفحه 141-183
Mina Moosapour؛ Ahmad Bagheri؛ Mohammad Javad Mahmoodabadi


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب