代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/367442/9748111
m minballdemo1.m
% Demo on finding minimal ball around data.
% Statistical Pattern Recognition Toolbox, Vojtech Franc, Vaclav Hlavac
% (c) Czech Technical University Prague, http://cmp.felk.cvut.cz
% Modifications
%
www.eeworm.com/read/110420/15534455
c stktrace.c
/* This file contains code to print function/arg stack tracebacks
* at run time, which is extremely useful for finding heap free() errors.
*/
#include
#include
#include
www.eeworm.com/read/104380/15696731
c stktrace.c
/* This file contains code to print function/arg stack tracebacks
* at run time, which is extremely useful for finding heap free() errors.
*/
#include
#include
#include
www.eeworm.com/read/176441/9498597
m rga.m
function [A,cond] = rga(a,b,c,d,w)
%RGA - Finds the RGA (relative gain array) matrix A of an LTI MIMO SYS
% model at a certain frequency value (w). The use of RGA its helpful for
% finding the coup
www.eeworm.com/read/360659/10082587
m rga.m
function [A,cond] = rga(a,b,c,d,w)
%RGA - Finds the RGA (relative gain array) matrix A of an LTI MIMO SYS
% model at a certain frequency value (w). The use of RGA its helpful for
% finding the coup
www.eeworm.com/read/275194/10830198
cpp memstate.cpp
// memstate.cpp: Microsoft specific memory state functions, for finding memory leaks
// Warning: this is raw research code -- expect it to be quite messy.
#include
#include
#incl
www.eeworm.com/read/466324/7033178
java exercise5_17.java
// Exercise5_17.java: Finding sales amount to meet the commission
public class Exercise5_17 {
// The commission sought
final static double COMMISSION_SOUGHT = 25000;
// Main method
publ
www.eeworm.com/read/458493/7295665
m secant.m
function x = secant(fun,a,b,xtol,ftol,verbose)
% secant Secant method for finding roots of scalar f(x) = 0
%
% Synopsis: x = secant(fun,a,b)
% x = secant(fun,a,b,xtol)
% x
www.eeworm.com/read/458488/7296090
m secant.m
function x = secant(fun,a,b,xtol,ftol,verbose)
% secant Secant method for finding roots of scalar f(x) = 0
%
% Synopsis: x = secant(fun,a,b)
% x = secant(fun,a,b,xtol)
% x
www.eeworm.com/read/452375/7441360
m kruskal.m
%
%---------------------kruskal.m---------------------
%
% Kruskal algorithm for finding minimum spanning tree
%
% Input: PV = nx3 martix. 1st and 2nd row's define the edge (2 vertices) and