代码搜索：Generalized

找到约 2,645 项符合「Generalized」的源代码

代码结果 2,645
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/373627/9446227

html surf.gls.html

R: Fits a Trend Surface by Generalized Least-squares
·
www.eeworm.com/read/170249/9813403

m nnigls.m

function [W1,W2,GAMMA,lambda]=nnigls(NetDef,NN,W1,W2,trparms,GAMMA,Y,U) % NNIGLS % ------ % Train a multi-output NNARX model using an iterated generalized % least squares metho
·
www.eeworm.com/read/328267/13036794

makefile

# Makefile for GiST test program # # Generalized Search Tree PROGRAM = RTree SRCS = command.cpp gram.y scan.l RTentry.cpp RTnode.cpp RTpredicate.cpp OBJS = command.o gram.ta
·
www.eeworm.com/read/305575/13765464

m ag2bc.m

function[bi,ci,ai]=ag2bc(ga,ar,b,c) %AG2BC Convert Morse wavelet parameters A and Gamma to Beta and C. % % AG2BC is used for determining parameter values of the Generalized % Morse Wavelets of
·
www.eeworm.com/read/147331/5732725

c tsearch.c

/* $NetBSD: tsearch.c,v 1.3 1999/09/16 11:45:37 lukem Exp $ */ /* * Tree search generalized from Knuth (6.2.2) Algorithm T just like * the AT&T man page says. * * The node_t structure is for inte
·
www.eeworm.com/read/147331/5732729

c tdelete.c

/* $NetBSD: tdelete.c,v 1.2 1999/09/16 11:45:37 lukem Exp $ */ /* * Tree search generalized from Knuth (6.2.2) Algorithm T just like * the AT&T man page says. * * The node_t structure is for inte
·
www.eeworm.com/read/147331/5732735

c twalk.c

/* $NetBSD: twalk.c,v 1.1 1999/02/22 10:33:16 christos Exp $ */ /* * Tree search generalized from Knuth (6.2.2) Algorithm T just like * the AT&T man page says. * * The node_t structure is for int
·
www.eeworm.com/read/147331/5732737

c tdestroy.c

/* $NetBSD: tdelete.c,v 1.2 1999/09/16 11:45:37 lukem Exp $ */ /* * Tree search generalized from Knuth (6.2.2) Algorithm T just like * the AT&T man page says. * * The node_t structure is for inte
·
www.eeworm.com/read/147331/5732740

c tfind.c

/* $NetBSD: tfind.c,v 1.2 1999/09/16 11:45:37 lukem Exp $ */ /* * Tree search generalized from Knuth (6.2.2) Algorithm T just like * the AT&T man page says. * * The node_t structure is for intern
·
www.eeworm.com/read/140847/5779770

m mk_gdl_graph.m

function gdl = mk_gdl_graph(G, domains, node_sizes, kernels, varargin) % MK_GDL_GRAPH Make a GDL (generalized distributed law) graph % gdl = mk_gdl_graph(G, domains, node_sizes, kernels, ...) % % A GD
·