代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/357022/3035114
data master2.data
$TTL 1000
@ in soa localhost. postmaster.localhost. (
1993050801 ;serial
3600 ;refresh
1800 ;retry
604800 ;expiration
3600 ) ;minimum
a in ns
a in ns ns2vix.com.
a in ns ns
www.eeworm.com/read/356084/3042421
m mcttrc_lp.m
% MCTTRC_LP -- find Minimum Cost to Time Ratio Cycle through Linear Programming
% Usage
% [x,ncycles,listcycles] = MCTTRC_LP(cost,time);
% Inputs
% [cost,time] cost and time values for
www.eeworm.com/read/356084/3042445
m matmin.m
% MatMin -- identify position of minimum entry in matrix
% Usage
% [val,pos2] = MatMin(mat);
% Inputs
% mat matrix
% Outputs
% val value of smallest entry
% pos2 [row,col] of lar
www.eeworm.com/read/356084/3042456
m findmcttrp.m
% FindMCTTRP -- find minimum cost to time ratio path in the beamlet graph
% Usage
% [vlist,ratio] = FindMCTTRP(cost,time,v0,v1,uppertime,uppernlist,stoptime);
% Inputs
% cost cost
www.eeworm.com/read/194440/8193575
m wavedyn.m
function [wavelet,twave]=wavedyn(dt,fdom,tlength)
% [wavelet,twave]=wavedyn(dt,fdom,tlength)
% [wavelet,twave]=wavedyn(dt,fdom)
% [wavelet,twave]=wavedyn(dt)
%
% WAVEDYN returns a minimum phase wa
www.eeworm.com/read/192895/8267480
h gjk.h
/* Header file for the Oxford version of Gilbert, Johnson and
Keerthi's minimum distance routine.
Version 2.4, July 1998, (c) Stephen Cameron 1996, 1997, 1998
*/
#include
#include
www.eeworm.com/read/173799/9635233
m tcd.m
function d = tcd(x, nchirp, decf, intf);
% tcd -- compute a time-chirp distribution
%
% Usage
% d = tcd(x, nchirp, decf, intf)
%
% Inputs
% x signal
% nchirp minimum number of points
www.eeworm.com/read/247527/12652438
m ga.m
function [x,fval,exitFlag,output,population,scores] = ga(FUN,genomeLength,options)
%GA Genetic algorithm solver.
% X = GA(FITNESSFCN,NVARS) finds the minimum of FITNESSFCN using
% GA. NVARS
www.eeworm.com/read/235612/14060636
m wavedyn.m
function [wavelet,twave]=wavedyn(dt,fdom,tlength)
% [wavelet,twave]=wavedyn(dt,fdom,tlength)
% [wavelet,twave]=wavedyn(dt,fdom)
% [wavelet,twave]=wavedyn(dt)
%
% WAVEDYN returns a minimum phase wa
www.eeworm.com/read/202785/15373279
m clustie.m
function [c,newx,newy]=clustie(x,y,n);
%
% Clustering programme
%
% HELLO!
%
% Determine the maximum and minimum of each
% input variable
%
xmax=max(x);
xmin=min(x);
xmean=mean(x);
ran