代码搜索：INF

找到约 10,000 项符合「INF」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/140847/5779602

m test_ho_inf_enginge.m

function [engine,engine2] = test_ho_inf_enginge(order,T) assert(order >= 1) % Model a SISO system, i. e. all node are one-dimensional % The nodes are numbered as follows % u(t) = 1 input % y(t) = 2 m
·
www.eeworm.com/read/140847/5779604

m stable_ho_inf_engine.m

function engine = dv_unrolled_dbn_inf_engine(bnet, T, varargin) % JTREE_UNROLLED_DBN_INF_ENGINE Unroll the DBN for T time-slices and apply jtree to the resulting static net % engine = jtree_unrolled_d
·
www.eeworm.com/read/140847/5779627

m pearl_dbn_inf_engine.m

function engine = pearl_dbn_inf_engine(bnet, varargin) % LOOPY_DBN_INF_ENGINE Loopy Pearl version of forwards-backwards % engine = loopy_dbn_inf_engine(bnet, ...) % % Optional arguments % 'max_iter' -
·
www.eeworm.com/read/140847/5779632

m jtree_dbn_inf_engine.m

function engine = jtree_dbn_inf_engine(bnet, varargin) % JTREE_DBN_INF_ENGINE Junction tree inference algorithm for DBNs. % engine = jtree_inf_engine(bnet, ...) % % The following optional arguments ca
·
www.eeworm.com/read/140847/5779633

m jtree_dbn_inf_engine.m

function engine = jtree_dbn_inf_engine(bnet, varargin) % JTREE_DBN_INF_ENGINE Junction tree inference algorithm for DBNs. ss = length(bnet.intra); onodes = []; if nargin >= 2 args = varargin; n
·
www.eeworm.com/read/133943/5897654

m jtree_limid_inf_engine.m

function engine = jtree_limid_inf_engine(bnet) % JTREE_LIMID_INF_ENGINE Make a junction tree engine for use by solve_limid % engine = jtree_limid_inf_engine(bnet) % % This engine is designed to comput
·
www.eeworm.com/read/133943/5897656

m cond_gauss_inf_engine.m

function engine = cond_gauss_inf_engine(bnet) % COND_GAUSS_INF_ENGINE Conditional Gaussian inference engine % engine = cond_gauss_inf_engine(bnet) % % Enumerates all the discrete roots, and runs jtree
·
www.eeworm.com/read/133943/5897672

m belprop_fg_inf_engine.m

function engine = belprop_fg_inf_engine(fg, varargin) % BELPROP_FG_INF_ENGINE Make a belief propagation inference engine for factor graphs % engine = belprop_fg_inf_engine(factor_graph, ...) % % The
·
www.eeworm.com/read/133943/5897691

m belprop_gdl_inf_engine.m

function engine = belprop_gdl_inf_engine(gdl, varargin) % BELPROP_GDL_INF_ENGINE Make a belief propagation inference engine for a GDL graph % engine = belprop_gdl_inf_engine(gdl_graph, ...) % % If th
·
www.eeworm.com/read/133943/5897693

m belprop_inf_engine_nostr.m

function engine = belprop_inf_engine(fg, max_iter, momentum, tol, maximize) if nargin < 2, max_iter = length(fg.G); end if nargin < 3, momentum = 0; end if nargin < 4, tol = 1e-3; end if nargin < 5,
·