Pages that link to "Item:Q1870808"

The following pages link to Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network (Q1870808):

Displaying 35 items.

• Fast and fine quickest path algorithm (Q296816) (← links)
• Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate (Q331848) (← links)
• An efficient alternative to the exact evaluation of the quickest path flow network reliability problem (Q342541) (← links)
• Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network (Q506140) (← links)
• A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network (Q527215) (← links)
• Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks (Q534935) (← links)
• A method to evaluate routing policy through \(p\) minimal paths for stochastic case (Q621591) (← links)
• System reliability for quickest path problems under time threshold and budget (Q623173) (← links)
• Assessing the reliability and the expected performance of a network under disaster risk (Q647517) (← links)
• Stochastic flow networks via multiple paths under time threshold and budget constraint (Q660929) (← links)
• Study on multi-objective optimization of flow allocation in a multi-commodity stochastic-flow network with unreliable nodes (Q949351) (← links)
• On transmission time through \(k\) minimal paths of a capacitated-flow network (Q967798) (← links)
• Time version of the shortest path problem in a stochastic-flow network (Q1019780) (← links)
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks (Q1750473) (← links)
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks (Q1751923) (← links)
• A label-setting algorithm for finding a quickest path (Q1886505) (← links)
• Reliable and economic resource allocation in an unreliable flow network (Q1886865) (← links)
• Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute (Q2115786) (← links)
• Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints (Q2178318) (← links)
• Reliability of a stochastic intermodal logistics network under spoilage and time considerations (Q2283182) (← links)
• Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget (Q2344678) (← links)
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (Q2379538) (← links)
• A comprehensive survey on the quickest path problem (Q2379862) (← links)
• An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method (Q2792202) (← links)
• System Reliability Assessment through<i>p</i>Minimal Paths in Stochastic Case with Backup-routing (Q2815376) (← links)
• Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints (Q2852104) (← links)
• Reliability evaluation of a multistate network subject to time constraint under routing policy (Q2872616) (← links)
• Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations (Q2876110) (← links)
• ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET (Q2911992) (← links)
• Algorithms for the quickest time distribution of dynamic stochastic-flow networks (Q4578177) (← links)
• Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint (Q4960684) (← links)
• DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS (Q5056602) (← links)
• Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks (Q5220004) (← links)
• Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability (Q5252893) (← links)
• Min‐Max quickest path problems (Q5326774) (← links)