代码搜索：sequential
找到约 1,846 项符合「sequential」的源代码
代码结果 1,846
www.eeworm.com/read/452209/7445693
ps viewjpeg.ps
%! viewjpeg.ps Copyright (C) Thomas Merz 1994
%
% View JPEG files with Ghostscript
%
% This PostScript code relies on level 2 features.
%
% Only JPEG baseline, extended sequential, and progres
www.eeworm.com/read/445437/7595522
c jacobi_omp.c
/*
* Sequential program that solves the steady-state temperature
* distribution problem using the Jacobi method.
*
* Compile on Belief:
* export PATH=/opt/SUNWspro/bin:$PATH
* cc -xO3
www.eeworm.com/read/441420/7670653
m ash_base.m
%ASH_BASE Estimation of ambiguities by sequential least squares.
% Goad's "60-77 Algorithm" determines the final ambiguities.
% Finally, estimation of the baseline vector follows.
%
www.eeworm.com/read/299459/7850293
c smo_mex.c
/* --------------------------------------------------------------------
smo_mex.c: MEX-file for Sequential Minimal Optimizer.
Compile: mex smo_mex.c ../kernels/kernel_fun.c
Synopsis:
[Alpha,b
www.eeworm.com/read/398324/7994398
m train.m
function net = train(tutor, x, y, C, kernel, zeta, net)
% TRAIN
%
% Train a support vector classification network, using the sequential minimal
% optimisation algorithm.
%
% net = train(tut
www.eeworm.com/read/398324/7994541
m train.m
function net = train(tutor, x, y, C, kernel, zeta, net)
% TRAIN
%
% Train a support vector classification network, using the sequential minimal
% optimisation algorithm.
%
% net = train(tut
www.eeworm.com/read/146126/12668334
cpp rsequentialsearch.cpp
// recursive sequential search
#include
#include // has copy
using namespace std;
template
int rSequentialSearch(T a[], int n, const T& x)
{// Search the
www.eeworm.com/read/146126/12668759
cpp sequentialsearch2.cpp
// sequential search of unordered list with an extra position
#include
#include
using namespace std;
template
int sequentialSearch(T a[], int n, const T& x)
www.eeworm.com/read/245176/12813287
m train.m
function net = train(tutor, x, y, C, kernel, zeta, net)
% TRAIN
%
% Train a support vector classification network, using the sequential minimal
% optimisation algorithm.
%
% net = train(tut
www.eeworm.com/read/144074/12819366
h dsearch.h
#ifndef DATATYPE_SEARCH_METHODS
#define DATATYPE_SEARCH_METHODS
// search the n element arrray a for a match with key
// using the sequential search. return the index of the
// matching array el