Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

5 articles for “Shortest Path Estimate”
Set a search alert
Research ArticleOpen accessIn the keywordsA REFINEMENT OF DIJKSTRA'S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHSSiddhartha Sankar Biswas, Bashir Alam, M. N. DojaThe networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network), attack or damage from internal or external agents, sudden failure of one or … …Journal of Computer Science, Vol. 10, Issue 4 · 14 Dec 2013 · 7,260 accessesView PDFCite
Research ArticleOpen accessIn the keywordsReal Time Multigraphs for Communication Networks: An Intuitionistic Fuzzy Mathematical ModelSiddhartha Sankar Biswas, Bashir Alam, Mohammad Najmud DojaMany problems of computer science, communication network, transportation systems, can be modeled into multigraphs (or graphs) and then can be solved. Nowadays, the networks are expanding very fast in huge volumes in terms of their nodes and the connecting links. For a given alive network, in many situations, its complete topology may not be always available to the communication systems … …Journal of Computer Science, Vol. 9, Issue 7 · 17 Jun 2013 · 7,068 accessesView PDFCite
Research ArticleOpen accessIn the keywordsGeneralization of Dijkstra’s Algorithm for Extraction of Shortest Paths in Directed MultigraphsBashir Alam, Siddhartha Sankar Biswas, M. N. DojaThe classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors generalize the classical Dijkstra’s algorithm to make it applicable to directed multigraphs. The modified algorithm is called by Generalized Dijkstra’s algorithm or GD Algorithm (GDA in short). The GDA outputs the shortest paths and the corresponding min cost. It … …Journal of Computer Science, Vol. 9, Issue 3 · 29 Apr 2013 · 7,466 accessesView PDFCite
Research ArticleOpen accessIn the abstractA PARTICLE SWARM OPTIMIZATION APPROACH FOR LOW POWER VERY LARGE SCALE INTEGRATION ROUTINGG. Nallathambi, S. RajaramThis study deals with the particle swarm optimization approach for optimal power dissipation in VLSI interconnect driven routing technique. Interconnect power dissipation is a major challenging research problem in Deep Submicron (DSM) regime that affects the overall circuit performance. The Buffer Insertion Buffer Sizing and Wire Sizing (BISWS) is considered for minimizing the power dissipation in VLSI circuits using interconnect … …Journal of Mathematics and Statistics, Vol. 10, Issue 1 · 1 Feb 2014 · 6,741 accessesView PDFCite
Research ArticleOpen accessIn the abstractEmpirical Analysis and Mathematical Representation of the Path Length Complexity in Binary Decision DiagramsA. Assi, P. W.C. Prasad, B. Mills, A. ElchouemiInformation about the distribution of path-lengths in a Binary Decision Diagrams (BDDs) representing Boolean functions is useful in determining the speed of hardware and software implementations of the circuit represented by these Boolean functions. This study presents expressions produced from an empirical analysis of a representative collection of Boolean functions. The Average Path Length (APL) and the Shortest Path Length … …Journal of Computer Science, Vol. 2, Issue 3 · 31 Mar 2006 · 6,814 accessesView PDFCite