Pages that link to "Item:Q1085043"
From MaRDI portal
The following pages link to Approximating the distribution functions in stochastic networks (Q1085043):
Displaying 27 items.
- Stochastic networks and the extreme value distribution (Q584063) (← links)
- A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept (Q852940) (← links)
- Mathematical theory of queueing networks (Q913640) (← links)
- A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network (Q1124724) (← links)
- Diffusion approximation of star-shaped symmetric networks with losses (Q1177805) (← links)
- The most critical path in a PERT network: A heuristic approach (Q1341990) (← links)
- Approximating network dynamics: some open problems (Q1671124) (← links)
- A new approach to determine the critical path in stochastic activity network (Q1718645) (← links)
- Path critical index and activity critical index in PERT networks (Q1848623) (← links)
- A new structural mechanism for reducibility of stochastic PERT networks (Q1869478) (← links)
- Functional strong law of large numbers for loads in a planar network model (Q1950692) (← links)
- A note on asymptotic distributions in maximum entropy models for networks (Q2018609) (← links)
- Shifted extended global Lanczos processes for trace estimation with application to network analysis (Q2035644) (← links)
- Networks of reinforced stochastic processes: asymptotics for the empirical means (Q2325374) (← links)
- Adjustment of the moments of the project completion times when activity times are exponentially distributed (Q2430617) (← links)
- A new approximation algorithm for obtaining the probability distribution function for project completion time (Q2460585) (← links)
- Rapid improvement of stochastic networks using two-moment approximations (Q2473181) (← links)
- Estimating the trace of matrix functions with application to complex networks (Q2679672) (← links)
- (Q3713833) (← links)
- Estimating Network Characteristics in Stochastic Activity Networks (Q3746754) (← links)
- Distributed Averaging With Random Network Graphs and Noises (Q4559579) (← links)
- Sup-norm approximation bounds for networks through probabilistic methods (Q4857502) (← links)
- Horvitz-Thompson estimator under partial information with an application to network degree distribution (Q5083985) (← links)
- (Q5090657) (← links)
- QRF (Q5270668) (← links)
- Estimating network edge probabilities by neighbourhood smoothing (Q5384536) (← links)
- (Q5439467) (← links)