代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/356808/10221123
m maorder.m
function qopt = maorder(x,qmin,qmax,pfa, flag)
%MAORDER MA order determination
% qopt = maorder(x, qmin, qmax,pfa, flag)
% x - time series (must be a vector)
% qmin - minimum MA order [defa
www.eeworm.com/read/356808/10221167
m maorder.m
function qopt = maorder(x,qmin,qmax,pfa, flag)
%MAORDER MA order determination
% qopt = maorder(x, qmin, qmax,pfa, flag)
% x - time series (must be a vector)
% qmin - minimum MA order [defa
www.eeworm.com/read/161658/10388514
h itemset.h
//
// Class for itemset.
//
//
#ifndef _ITEMSET_H_
#define _ITEMSET_H_
#include "tzObject.h"
#include
typedef int Item;
/* to find the minimum and maximum integer from two p
www.eeworm.com/read/352543/10542085
m torr_add_manual_matches.m
%
% \pao
% \bi
% \item {\tt matches12} matches in an $n \times 4$ array of matches $(x,y,x'y')$, in this
% case $n$ is the number of matches.
% \item {\tt minc} is the minimum value of $C$ for e
www.eeworm.com/read/352442/10552342
m maorder.m
function qopt = maorder(x,qmin,qmax,pfa, flag)
%MAORDER MA order determination
% qopt = maorder(x, qmin, qmax,pfa, flag)
% x - time series (must be a vector)
% qmin - minimum MA order [defa
www.eeworm.com/read/159560/10639989
m torr_add_manual_matches.m
%
% \pao
% \bi
% \item {\tt matches12} matches in an $n \times 4$ array of matches $(x,y,x'y')$, in this
% case $n$ is the number of matches.
% \item {\tt minc} is the minimum value of $C$ for e
www.eeworm.com/read/277112/10667288
pas unit1.pas
{: Sample screen-saver for GLScene using TScreenSaver.
I've kept the OpenGL stuff to a minimum here, the saver is just animating
a cube on your screen, with 3 colored dancing light source. Al
www.eeworm.com/read/349622/10813663
m maorder.m
function qopt = maorder(x,qmin,qmax,pfa, flag)
%MAORDER MA order determination
% qopt = maorder(x, qmin, qmax,pfa, flag)
% x - time series (must be a vector)
% qmin - minimum MA order [defa
www.eeworm.com/read/270946/11018935
m maorder.m
function qopt = maorder(x,qmin,qmax,pfa, flag)
%MAORDER MA order determination
% qopt = maorder(x, qmin, qmax,pfa, flag)
% x - time series (must be a vector)
% qmin - minimum MA order [defa
www.eeworm.com/read/462824/7195092
c kruskal.c
/* Program for creating a minimum spanning tree from Kruskal's algorithm */
#include
#define MAX 20
struct edge
{
int u;
int v;
int weight;
struct edge *link;
}*front = NULL;