代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/268072/11155349
c fixedpointiter.c
/* This program is about the root-finding algorithm "Fixed Point Iteration",
* which is described in detail below. This program depends on the file
* "funct.c" in which the function g(x) is de
www.eeworm.com/read/147693/12538581
pl fig9_7.pl
% Figure 9.7 Finding an item X in a binary dictionary.
% in( X, Tree): X in binary dictionary Tree
in( X, t( _, X, _) ).
in( X, t( Left, Root, Right) ) :-
gt( Root, X),
www.eeworm.com/read/235187/14082466
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/202486/15381540
cpp pr0608.cpp
// Programming with C++, Second Edition, by John R. Hubbard
// Copyright McGraw-Hill, 2000
// Problem 6.8 on page 143
// Finding the minimum value in an array
#include // defines
www.eeworm.com/read/202486/15381873
cpp pr0513.cpp
// Programming with C++, Second Edition, by John R. Hubbard
// Copyright McGraw-Hill, 2000
// Problem 5.13
// Finding the minimum of four integers
#include // defines the cout ob
www.eeworm.com/read/202486/15381898
cpp pr0610.cpp
// Programming with C++, Second Edition, by John R. Hubbard
// Copyright McGraw-Hill, 2000
// Problem 6.10 on page 143
// Finding the minimum and maximum values in an array
#include
www.eeworm.com/read/191613/8425967
cpp pr0519.cpp
// Programming with C++, Second Edition, by John R. Hubbard
// Copyright McGraw-Hill, 2000
// Problem 5.19 on page 113
// Finding the least common multiple
#include // defines th
www.eeworm.com/read/191613/8426071
cpp pr0611.cpp
// Programming with C++, Second Edition, by John R. Hubbard
// Copyright McGraw-Hill, 2000
// Problem 6.11 on page 143
// Finding the two largest values in an array
#include // d
www.eeworm.com/read/384289/8881711
m decorrel.m
function [Q,Z,L,D,z] = decorrel (Q,a);
%DECORREL: Decorrelate a (co)variance matrix of ambiguities
%
% This routine creates a decorrelated Q-matrix, by finding the
% Z-matrix and performing the corres
www.eeworm.com/read/184524/9096857
m anlz_trl.m
function [avg,minn,maxx,stdd,times,k] = anlz_trl(trail,task,from,to,nskip)
% Analyze a transition trail by finding specific patterns and computin
% time differences
% trail - the audit trail to be