代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/338928/12271447
java partitionndi.java
//package datamining;
import java.io.*;
import java.util.*;
/**
* Class for implementing partition algorithm for
* finding non-derivable frequent itemsets.
*
* @author Michael Holler
www.eeworm.com/read/338523/12302366
m ga_ex343.m
% GA_ex343.m file
% Finding scaling factors Se Sde and dSu.
% PenChen Chou, 2-6-2002
%**********************************************************/
% User can modify the following in block
www.eeworm.com/read/149908/12334454
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.
*
* This code is highly specific to Borland C and the 8
www.eeworm.com/read/128468/14295678
m fishdemo.m
function []=fishdemo(action,hfigure,varargin)
% FISHDEMO demo on algorithms which learn Fisher's classifer.
%
% FISHDEMO demonstrates use of algorithms finding the Fisher's
% classifier. The task is
www.eeworm.com/read/124283/14579274
texi min.texi
@cindex optimization, see minimization
@cindex maximization, see minimization
@cindex minimization, one-dimensional
@cindex finding minima
@cindex non-linear functions, minimization
This chapter desc
www.eeworm.com/read/123562/14624454
java knightthread.java
import java.awt.*;
/** This class is responsible for actually solving the Knight's Tour problem
of finding a Hamiltonian cycle for the knight on a chess board. The tour
goes through each squa
www.eeworm.com/read/221058/14758802
java samplingndi.java
package datamining;
import java.io.*;
import java.util.*;
/**
* Class for finding frequent itemsets using sampling
* with the NDI algorithm.
*
* @author Michael Holler
* @version 0.1
www.eeworm.com/read/118063/14889060
asm string.asm
comment #
STRING.ASM
Finding strings in memory
Author: Dave Walker
placed in public domain
The actual search is quite easy, due to the magical "rep cmpsb"
instruction. T
www.eeworm.com/read/212047/15166877
texi min.texi
@cindex optimization, see minimization
@cindex maximization, see minimization
@cindex minimization, one-dimensional
@cindex finding minima
@cindex non-linear functions, minimization
This chapter desc
www.eeworm.com/read/210839/15191712
il mot_find_stubs.il
; stub-finding SKILL routine
; Written by: Chris Walters Motorola SSTG 2000/04/28
;
; Description:
; This SKILL routine will find and identify "stubs" , pieces of etch on a net
; that do not t