代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/452695/7436395
c program2_11.c
/* Program 2.11 Finding the limits */
#include /* For command line input and output */
#include < limits.h > /* For limits on integer types */
#include /* F
www.eeworm.com/read/448424/7533697
m findnext.m
%Optimization Algorithm ?finding the next point
function [newpointa,newpointb, newstepa, newstepb, nerror] = findnext(pointa , pointb, stepa, stepb, cerror)
err1 = cerror;
fpointa = pointa;
f
www.eeworm.com/read/440621/7685528
txt asprotect 2.0x log all highmem calls.txt
// Script for OllyScript plugin
/*
//////////////////////////////////////////////////
it's been a hard time finding all the HIGHMEM calls 'n fixing them
so, i took some time 'n made these scripts. ho
www.eeworm.com/read/439686/7702984
m missmult.m
function [X]=missmult(A,B)
%MISSMULT product of two matrices containing NaNs
%
%[X]=missmult(A,B)
%This function determines the product of two matrices containing NaNs
%by finding X according t
www.eeworm.com/read/435150/7796331
cpp prog3_02.cpp
// Program 3.2 Finding the sizes of data types
#include
using std::cout;
using std::endl;
int main() {
// Output the sizes for integer types
cout
www.eeworm.com/read/198140/7949931
m costfuncmad.m
% Computes the Mean Absolute Difference (MAD) for the given two blocks
% Input
% currentBlk : The block for which we are finding the MAD
% refBlk : the block w.r.t. which the MAD is being
www.eeworm.com/read/198140/7950061
m costfuncmad.m
% Computes the Mean Absolute Difference (MAD) for the given two blocks
% Input
% currentBlk : The block for which we are finding the MAD
% refBlk : the block w.r.t. which the MAD is being
www.eeworm.com/read/144969/12758851
m4 warning.m4
# Finding valid warning flags for the C Compiler. -*-Autoconf-*-
#
# Copyright (C) 2001, 2002 Free Software Foundation, Inc.
#
# This program is free software; you can redistribute it and/or
www.eeworm.com/read/327456/13076969
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/327456/13076976
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
*