期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Enhancing Critical Path Problem in Neutrosophic Environment Using Python
1
作者 M.Navya Pratyusha Ranjan Kumar 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第9期2957-2976,共20页
In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an ext... In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an extended fuzzy approach,often known as neutrosophic logic.Our rigorous proposed model has led to the creation of an advanced technique for computing the triangular single-valued neutrosophic number.This innovative approach evaluates the inherent uncertainty in project durations of the planning phase,which enhances the potential significance of the decision-making process in the project.Our proposed method,for the first time in the neutrosophic set literature,not only solves existing problems but also introduces a new set of problems not yet explored in previous research.A comparative study using Python programming was conducted to examine the effectiveness of responsive and adaptive planning,as well as their differences from other existing models such as the classical critical path problem and the fuzzy critical path problem.The study highlights the use of neutrosophic logic in handling complex projects by illustrating an innovative dynamic programming framework that is robust and flexible,according to the derived results,and sets the stage for future discussions on its scalability and application across different industries. 展开更多
关键词 classical critical path problem fuzzy critical path problem uncertainty neutrosophic triangular single-valued neutrosophic number neutrosophic critical path problem python programming languag
下载PDF
On Polynomial Maximum EntropyMethod for ClassicalMoment Problem
2
作者 Jiu Ding Noah H.Rhee Chenhua Zhang 《Advances in Applied Mathematics and Mechanics》 SCIE 2016年第1期117-127,共11页
The maximum entropy method for the Hausdorff moment problem suffers from ill conditioning as it uses monomial basis{1,x,x2,···,xn}.Themaximum entropy method for the Chebyshev moment probelm was studied ... The maximum entropy method for the Hausdorff moment problem suffers from ill conditioning as it uses monomial basis{1,x,x2,···,xn}.Themaximum entropy method for the Chebyshev moment probelm was studied to overcome this drawback in[4].In this paper we review and modify the maximum entropy method for the Hausdorff and Chebyshev moment problems studied in[4]and present the maximum entropy method for the Legendre moment problem.We also give the algorithms of converting the Hausdorff moments into the Chebyshev and Lengendre moments,respectively,and utilizing the corresponding maximum entropy method. 展开更多
关键词 classical moment problem MONOMIALS Chebyshev polynomials Legendre polynomials
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部