Majid Forghani-elahabad

Orcid: 0000-0003-1691-7633

According to our database1, Majid Forghani-elahabad authored at least 21 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers.
Big Data Cogn. Comput., September, 2024

Enhancing consecutiveness in elastic optical networks.
Photonic Netw. Commun., April, 2024

2023
Usage of task and data parallelism for finding the lower boundary vectors in a stochastic-flow network.
Reliab. Eng. Syst. Saf., October, 2023

Application of LSTM based on the BAT-MCS for binary-state network approximated time-dependent reliability problems.
Reliab. Eng. Syst. Saf., July, 2023

Assessing the reliability of multistate flow networks considering distance constraints.
CoRR, 2023

2022
New binary-addition tree algorithm for the all-multiterminal binary-state network reliability problem.
Reliab. Eng. Syst. Saf., 2022

An improved algorithm for reliability evaluation of flow networks.
Reliab. Eng. Syst. Saf., 2022

An alternative approach to the exact network reliability assessment through the quickest path.
CoRR, 2022

2021
Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks.
Reliab. Eng. Syst. Saf., 2021

Assessing the performance of smart grid communication networks under both time and budget constraints.
CoRR, 2021

2020
General multi-state rework network and reliability algorithm.
Reliab. Eng. Syst. Saf., 2020

2019
An MP-based approximation algorithm on reliability evaluation of multistate flow networks.
Reliab. Eng. Syst. Saf., 2019

An approximate approach for reliability evaluation of a multistate flow network in terms of minimal cuts.
J. Comput. Sci., 2019

Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint.
IISE Trans., 2019

2017
Finding all the Lower Boundary Points in a Multistate Two-Terminal Network.
IEEE Trans. Reliab., 2017

An improved algorithm for RWA problem on sparse multifiber wavelength routed optical networks.
Opt. Switch. Netw., 2017

2016
A New Algorithm for Generating All Minimal Vectors for the q SMPs Reliability Problem With Time and Budget Constraints.
IEEE Trans. Reliab., 2016

2015
An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint.
Reliab. Eng. Syst. Saf., 2015

2014
A New Efficient Approach to Search for All Multi-State Minimal Cuts.
IEEE Trans. Reliab., 2014

A Comparative Study of Different Approaches for Finding the Upper Boundary Points in Stochastic-Flow Networks.
Int. J. Enterp. Inf. Syst., 2014

2009
A note on "A simple approach to search for all d-MCs of a limited-flow network".
Reliab. Eng. Syst. Saf., 2009


  Loading...