Browsing by Author "Sharma, Megha"
Now showing items 1-6 of 6
-
Algorithms for evaluation and design of reliable networks
Sharma, Megha (2010)A reliable network is a network in which network elements, i.e., arcs and/or nodes, are functional only with a pre-specified probability. Such networks are used to model real-life networks such as telecommunication networks ... -
Computing the Probability Mass Function of the Maximum Flow through a Reliable Network
Sharma, Megha; Ghosh, Diptesh (2011-05-26)This paper proposes a fast state-space enumeration based algorithm called TOP-DOWN capable of computing the probability mass function of the maximum s-t flow through reliable networks. The algorithm computes the probability ... -
Determining the optimal release time of movies: A study of movie and market characteristics
Sharma, Megha; Basu, Sumanta; Chakraborty, Soumyakanti; Bose, Indranil (Elsevier, 2022-11-11)The over-the-top (OTT) industry has witnessed remarkable growth in recent years with a sharp increase in the number of subscribers, leading to increased competition among OTT platforms to acquire movie rights. Consequently, ... -
An empirical investigation into randomly generated euclidean symmetric traveling salesman problems
Sharma, Megha; Ghosh, Diptesh (2010-07-22)The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance ... -
Evaluating Downside Risks in Reliable Networks
Sharma, Megha; Ghosh, Diptesh (2011-05-27)Reliable networks are those in which network elements have a positive probability of failing. Conventional performance measures for such networks concern themselves either with expected network performance or with the ... -
Speeding Up the Estimation of Expected Maximum Flows through Reliable Networks
Sharma, Megha; Ghosh, Diptesh (2011-05-27)This paper presents a strategy for speeding up the estimation of expected maximum flows through reliable networks. Computational experiments with the strategy on three types of randomly generated networks show that it ...