代码搜索结果

/* Author: Pate Williams (c) 1997 Polynomial extended Euclidean algorithm. See "Handbook of Applied Cryptography" by Alfred J. Menezes et al 2.6.2 Section 2.2.1 Algorithm page 82. *

/* Author: Pate Williams (c) 1997 Gordon's algorithm for generating strong primes. See "Handbook of Applied Cryptography" by Alfred J. Menezes et al 4.53 Algorithm page 150. */

/* Author: Pate Williams (c) 1997 14.54 Algorithm Binary gcd algorithm See "Handbook of Applied Cryptography" by Alfred J. Menezes et al page 606. */ #include #in

/* Author: Pate Williams (c) 1997 Polynomial extended Euclidean algorithm. See "Handbook of Applied Cryptography" by Alfred J. Menezes et al 2.6.2 Section 2.2.1 Algorithm page 82. *

// Free implementation of the TIGER hash algorithm // Based on LibTomCrypt's implementation of the TIGER hash algorithm #include "tiger.h" // Partial table pointers #define tiger_t1 (tiger_t

function g = kernel_reduce_merge(g, N, adjustP) % Matt Ridley's algorithm: conserves mean, optionally adjust variance at end % Based on the GMM smallest-weight clustering algorithm as described in

// ChildView.cpp : implementation of the CChildView class // #include "stdafx.h" #include "GaSchedule.h" #include "ChildView.h" #include "Algorithm\Configuration.h" #include "Algorithm\Room.

function g = kernel_reduce_merge(g, N, adjustP) % Matt Ridley's algorithm: conserves mean, optionally adjust variance at end % Based on the GMM smallest-weight clustering algorithm as described in

function [X,rho,eta] = rrgmres(A,b,k) %RRGMRES Range-restricted GMRES algorithm for square inconsistent systems % % [X,rho,eta] = rrgmres(A,b,k) % % RRGMRES is a variant of the GMRES algorithm fo

The GA Playground: TSP by Genetic Algorithm