IFAC Proceedings Volumes · 2012 · 14 citations · 6 references
ComputingComputer ScienceMathematicsProbability TheoryStochastic ModelingStochastic ProcessesAlgorithm AnalysisAlgorithmic ComplexityComplexity TheoryComputational ComplexityStochastic OptimizationTime ComplexityAccuracyApproximation ComplexityApproximation GuaranteesLower BoundsProbabilistic Analysis Of Algorithms
6
Comparison Methods for Stochastic Models and Risks
Mark Anthony McComb · Technometrics · 2003 · 1.3K citations
Computing shortest paths for any number of hops
R. Guérin, Ariel Orda · IEEE/ACM Transactions on Networking · 2002 · 120 citations · Full text