代码搜索:Inference

找到约 1,820 项符合「Inference」的源代码

代码结果 1,820
www.eeworm.com/read/140847/5779188

m filter_test1.m

% Compare online filtering algorithms on some DBNs seed = 0; rand('state', seed); randn('state', seed); if 0 N = 3; Q = 2; obs_size = 1; discrete_obs = 0; bnet = mk_chmm(N, Q, o
www.eeworm.com/read/140847/5779504

m enumerative_inf_engine.m

function engine = enumerative_inf_engine(bnet) % ENUMERATIVE_INF_ENGINE Inference engine for fully discrete BNs that uses exhaustive enumeration. % engine = enumerative_inf_engine(bnet) assert(isemp
www.eeworm.com/read/133943/5897372

m filter_test1.m

% Compare online filtering algorithms on some DBNs seed = 0; rand('state', seed); randn('state', seed); if 0 N = 3; Q = 2; obs_size = 1; discrete_obs = 0; bnet = mk_chmm(N, Q, o
www.eeworm.com/read/133943/5897687

m enumerative_inf_engine.m

function engine = enumerative_inf_engine(bnet) % ENUMERATIVE_INF_ENGINE Inference engine for fully discrete BNs that uses exhaustive enumeration. % engine = enumerative_inf_engine(bnet) assert(isemp
www.eeworm.com/read/347853/11631277

pro expert.pro

/* Expert System Shell */ include"resort.pro" predicates inference(data_type) check_rule(integer,data_type,data_list) process_rule(integer,data_type,data_list) process_fa
www.eeworm.com/read/160391/5571233

m filter_test1.m

% Compare online filtering algorithms on some DBNs seed = 0; rand('state', seed); randn('state', seed); if 0 N = 3; Q = 2; obs_size = 1; discrete_obs = 0; bnet = mk_chmm(N, Q, o
www.eeworm.com/read/160391/5571550

m enumerative_inf_engine.m

function engine = enumerative_inf_engine(bnet) % ENUMERATIVE_INF_ENGINE Inference engine for fully discrete BNs that uses exhaustive enumeration. % engine = enumerative_inf_engine(bnet) assert(
www.eeworm.com/read/140847/5779091

m gaussian1.m

% Make the following network (from Jensen (1996) p84 fig 4.17) % 1 % / | \ % 2 3 4 % | | | % 5 6 7 % \/ \/ % 8 9 % where all arcs point downwards N = 9; dag = zeros(N,N); dag(1,2)=1; d
www.eeworm.com/read/140847/5779154

m bkff1.m

% Compare different implementations of fully factored Boyen Koller water = 1; if water bnet = mk_water_dbn; else N = 5; Q = 2; Y = 2; bnet = mk_chmm(N, Q, Y); end ss = length(bnet.intra);
www.eeworm.com/read/133943/5897277

m gaussian1.m

% Make the following network (from Jensen (1996) p84 fig 4.17) % 1 % / | \ % 2 3 4 % | | | % 5 6 7 % \/ \/ % 8 9 % where all arcs point downwards N = 9; dag = zeros(N,N); dag(1,2)=1; d