代码搜索：given
找到约 10,000 项符合「given」的源代码
代码结果 10,000
www.eeworm.com/read/393163/2488870
m calc_mpe_given_inf_engine.m
function [mpe, prob] = calc_mpe_given_inf_engine(engine, evidence)
% CALC_MPE_GIVEN_ENGINE Computes the most probable explanation of the evidence
% [mpe, prob] = calc_mpe_given_inf_engine(engine, ev
www.eeworm.com/read/160391/5571355
m gaussian_cpd_params_given_dps.m
function [m, C, W] = gaussian_CPD_params_given_dps(CPD, domain, evidence)
% GAUSSIAN_CPD_PARAMS_GIVEN_EV_ON_DPS Extract parameters given evidence on all discrete parents
% function [m, C, W] = gauss
www.eeworm.com/read/160391/5571814
m calc_mpe_given_inf_engine.m
function [mpe, prob] = calc_mpe_given_inf_engine(engine, evidence)
% CALC_MPE_GIVEN_ENGINE Computes the most probable explanation of the evidence
% [mpe, prob] = calc_mpe_given_inf_engine(engine, ev
www.eeworm.com/read/275831/10794078
rb 09 - killing all processes for a given user.rb
#!/usr/bin/ruby -w
# banish.rb
def signal_all(username, signal)
lookup_uid(username)
killed = 0
%x{ps -U #{username}}.each_with_index do |proc, i|
next if i == 0 # Skip the header provided
www.eeworm.com/read/199525/5076687
svn-base filter-model-given-input.pl.svn-base
K 13
svn:eol-style
V 6
native
K 14
svn:executable
V 1
*
K 12
svn:keywords
V 23
Author Date Id Revision
END
www.eeworm.com/read/199525/5076699
svn-base filter-model-given-input.pl.svn-base
#!/usr/bin/perl -w
# Given a moses.ini file and an input text prepare minimized translation
# tables and a new moses.ini, so that loading of tables is much faster.
# original code by Philipp Koehn
#
www.eeworm.com/read/420735/2065172
svn-base filter-model-given-input.pl.svn-base
K 13
svn:eol-style
V 6
native
K 14
svn:executable
V 1
*
K 12
svn:keywords
V 23
Author Date Id Revision
END
www.eeworm.com/read/420735/2065187
svn-base filter-model-given-input.pl.svn-base
#!/usr/bin/perl -w
# $Id$
# Given a moses.ini file and an input text prepare minimized translation
# tables and a new moses.ini, so that loading of tables is much faster.
# original code by Philipp
www.eeworm.com/read/396844/2407104
m mk_rnd_dag_given_edge_prob.m
function dag = sample_dag(P)
% SAMPLE_DAG Create a random directed acyclic graph with edge probabilities P(i,j)
% dag = sample_dag(P)
%
% This uses rejection sampling to reject graphs with directed cy
www.eeworm.com/read/419852/10833908
txt check if a given binary tree is a binary search tree.txt
Write C code to check if a given binary tree is a binary search tree or not?
Discuss it!
int isThisABST(struct node* mynode)
{
if (mynode==NULL) return(true);