代码搜索:node

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

代码结果 10,000
www.eeworm.com/read/396844/2406950

m tabular_utility_node.m

function CPD = tabular_utility_node(bnet, node, T) % TABULAR_UTILITY_NODE Represent a utility function as a table % CPD = tabular_utility_node(bnet, node, T) % % node is the number of a node in this e
www.eeworm.com/read/396844/2406959

m log_prob_node.m

function L = log_prob_node(CPD, self_ev, pev) % LOG_PROB_NODE Compute prod_m log P(x(i,m)| x(pi_i,m), theta_i) for node i (gaussian) % L = log_prob_node(CPD, self_ev, pev) % % self_ev(m) is the eviden
www.eeworm.com/read/396844/2406965

m log_prob_node.m

function L = log_prob_node(CPD, self_ev, pev) % LOG_PROB_NODE Compute prod_m log P(x(i,m)| x(pi_i,m), theta_i) for node i (gaussian) % L = log_prob_node(CPD, self_ev, pev) % % self_ev(m) is the eviden
www.eeworm.com/read/396844/2406984

m tabular_chance_node.m

function CPD = tabular_chance_node(sz, CPT) % TABULAR_CHANCE_NODE Like tabular_CPD, but simplified % CPD = tabular_chance_node(sz, CPT) % % sz(1:end-1) is the sizes of the parents, sz(end) is the size
www.eeworm.com/read/396844/2407042

m log_prob_node.m

function L = log_prob_node(CPD, self_ev, pev) % LOG_PROB_NODE Compute sum_m log P(x(i,m)| x(pi_i,m), theta_i) for node i (discrete) % L = log_prob_node(CPD, self_ev, pev) % % self_ev(m) is the evidenc
www.eeworm.com/read/396844/2407059

m log_prob_node.m

function L = log_prob_node(CPD, self_ev, pev) % LOG_PROB_NODE Compute prod_m log P(x(i,m)| x(pi_i,m), theta_i) for node i (root) % L = log_prob_node(CPD, self_ev, pev) % % self_ev{m} is the evidence o
www.eeworm.com/read/396844/2407067

m tabular_decision_node.m

function CPD = tabular_decision_node(sz, CPT) % TABULAR_DECISION_NODE Represent the randomized policy over a discrete decision/action node as a table % CPD = tabular_decision_node(sz, CPT) % % sz(1:en
www.eeworm.com/read/396844/2407070

m tabular_decision_node.m

function CPD = tabular_decision_node(bnet, self, CPT) % TABULAR_DECISION_NODE Represent a stochastic policy over a discrete decision/action node as a table % CPD = tabular_decision_node(bnet, self, CP
www.eeworm.com/read/396640/2408913

c node_misc1.c

#include "fitz-base.h" #include "fitz-world.h" void fz_droplinknode(fz_linknode* node); void fz_droppathnode(fz_pathnode* node); void fz_droptextnode(fz_textnode* node); void fz_dropimagenode(fz_imag
www.eeworm.com/read/396640/2408918

c node_misc2.c

#include "fitz-base.h" #include "fitz-world.h" /* * Over */ fz_error * fz_newovernode(fz_node **nodep) { fz_node *node; node = *nodep = fz_malloc(sizeof (fz_overnode)); if (!node) return fz_