Prabha Sharma

According to our database1, Prabha Sharma authored at least 19 papers between 1982 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Risk integrated effort estimation of software projects: a comparative analysis of machine learning techniques.
Int. J. Syst. Syst. Eng., 2025

2024
Integrated Software Effort Estimation: A Hybrid Approach.
Informatica (Slovenia), 2024

2023
MalAnalyser: An effective and efficient Windows malware detection method based on API call sequences.
Expert Syst. Appl., November, 2023

2022
Integrating software effort estimation with risk management.
Int. J. Syst. Assur. Eng. Manag., 2022

Feature reduction of rich features for universal steganalysis using a metaheuristic approach.
Int. J. Comput. Sci. Eng., 2022

2018
An improved dynamic discrete firefly algorithm for blind image steganalysis.
Int. J. Mach. Learn. Cybern., 2018

A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights.
EURO J. Comput. Optim., 2018

2016
A hybrid feature selection approach based on improved PSO and filter approaches for image steganalysis.
Int. J. Mach. Learn. Cybern., 2016

2012
An efficient local search for minimizing completion time variance in permutation flow shops.
Comput. Oper. Res., 2012

2011
An efficient local search scheme for minimizing mean absolute deviation of completion times.
Comput. Ind. Eng., 2011

2006
Algorithms for the optimum communication spanning tree problem.
Ann. Oper. Res., 2006

2005
A combinatorial arc tolerance analysis for network flow problems.
Adv. Decis. Sci., 2005

Preface.
Adv. Decis. Sci., 2005

2002
A network simplex algorithm with O(<i>n</i>) consecutive degenerate pivots.
Oper. Res. Lett., 2002

Permutation Polyhedra and Minimisation of the Variance of Completion Times on a Single Machine.
J. Heuristics, 2002

1997
A new pivot selection rule for the network simplex algorithm.
Math. Program., 1997

1985
A decomposition algorithm for linear relaxation of the weighted <i>r</i>-covering problem.
Math. Program., 1985

1984
Constrained Optimum Communication Trees and Sensitivity Analysis.
SIAM J. Comput., 1984

1982
An extension of the edge covering problem.
Math. Program., 1982


  Loading...