代码搜索：Probability
找到约 4,670 项符合「Probability」的源代码
代码结果 4,670
www.eeworm.com/read/239861/13252710
m smallworld.m
clear
clc
N=20; %vertex of the network
p=0.3; %the probability of link
k=2; %%%% k
www.eeworm.com/read/318840/13471261
m demo1.m
% M. S. Grewal and A. P. Andrews,
% Kalman Filtering: Theory and Practice,
% published by Wiley ,2000.
% Demonstration of probability conditioning on
% measurements.
disp('M. S. Grewal and A. P.
www.eeworm.com/read/314385/13568719
m demo1.m
% M. S. Grewal and A. P. Andrews,
% Kalman Filtering: Theory and Practice,
% published by Wiley ,2000.
% Demonstration of probability conditioning on
% measurements.
disp('M. S. Grewal and A. P.
www.eeworm.com/read/488727/6484733
html 153-154.html
The Data Compression Book-:Statistical Modeling
www.eeworm.com/read/488727/6484734
html 164-166.html
The Data Compression Book-:Statistical Modeling
www.eeworm.com/read/488727/6484809
html 011-014.html
The Data Compression Book-:The Data-Compression Lexicon, with a History
www.eeworm.com/read/478401/6716202
m demo1.m
% M. S. Grewal and A. P. Andrews,
% Kalman Filtering: Theory and Practice,
% published by Wiley ,2000.
% Demonstration of probability conditioning on
% measurements.
disp('M. S. Grewal and A. P.
www.eeworm.com/read/409296/11333618
m erlangbinv.m
%
% n=erlangbinv(p,rho)
%
% This function finds the smallest n such the Erlang B probability that
% a system with n servers, no waiting line, Poisson arrival rate lambda,
% service rate (per server) m
www.eeworm.com/read/409296/11333621
m erlangb.m
%
% B=erlangb(n,rho)
%
% This function computes the Erlang B probability that a system with n
% servers, no waiting line, Poisson arrival rate lambda, service rate
% (per server) mu, and intensity rh
www.eeworm.com/read/409296/11333623
m engset.m
%
% E=engset(m,n,rho)
%
% This function computes the Engset blocking probability for a system with
% a finite population m of customers, n servers, no waiting line,
% exponentially distributed service