代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/258893/4349223
h bnsieve.h
/*
* bnsieve.h - Trial division for prime finding.
*
* This is generally not intended for direct use by a user of the library;
* the bnprime.c and dhprime.c functions. are more likely to be us
www.eeworm.com/read/258893/4349936
h bnsieve.h
/*
* bnsieve.h - Trial division for prime finding.
*
* This is generally not intended for direct use by a user of the library;
* the bnprime.c and dhprime.c functions. are more likely to be us
www.eeworm.com/read/160391/5571162
m qmr1.m
% Make a QMR-like network
% This is a bipartite graph, where the top layer contains hidden disease nodes,
% and the bottom later contains observed finding nodes.
% The diseases have Bernoulli CPDs
www.eeworm.com/read/473219/6848796
m rounder.m
function [upper,x_min] = rounder(p,relaxedsolution)
% Extremely simple heuristic for finding integer
% solutions.
%
% Rounds up and down, fixes etc.
% This was the relaxed solution
x = relax
www.eeworm.com/read/193277/8241959
m rounder.m
function [upper,x_min] = rounder(p,relaxedsolution)
% Extremely simple heuristic for finding integer
% solutions.
%
% Rounds up and down, fixes etc.
% This was the relaxed solution
x = relax
www.eeworm.com/read/172354/9712615
m b_point.m
function pos = b_point(Eph,pr,sv,time) %%%%%
%B_POINT Prepares input to the Bancroft algorithm for finding
% a preliminary position of a receiver. The input is
% name of ephemeris file,
www.eeworm.com/read/172354/9712641
m b_point.m
function pos = b_point(pr,sv,time,Eph)
%B_POINT Prepares input to the Bancroft algorithm for finding
% a preliminary position of a receiver. The input is
% four or more pseudoranges an
www.eeworm.com/read/172354/9712751
m b_point.m
function pos = b_point(Eph,pr,sv,time) %%%%%
%B_POINT Prepares input to the Bancroft algorithm for finding
% a preliminary position of a receiver. The input is
% name of ephemeris file,
www.eeworm.com/read/172354/9712770
m b_point.m
function pos = b_point(pr,sv,time,Eph)
%B_POINT Prepares input to the Bancroft algorithm for finding
% a preliminary position of a receiver. The input is
% four or more pseudoranges an
www.eeworm.com/read/172014/9726643
m contents.m
% NMM toolbox: routines for finding the roots of f(x) = 0
%
% bisect Use bisection to find a root of the scalar equation f(x) = 0
% brackPlot Find and plot brackets for roots of a function.