代码搜索结果

The Lempel-Ziv-Markov chain-Algorithm (LZMA) provides very high compression ratio and fast decompression. The core of the LZMA utils is Igor Pavlov's LZMA SDK containing the actual LZMA encoder/decod

function [sp, spcost] = dijkstra(matriz_costo, s, d) % This is an implementation of the dijkstra磗 algorithm, wich finds the % minimal cost path between two nodes. It磗 supoussed to solve the problem

#: c06:StrategyPattern.py # The strategy interface: class FindMinima: # Line is a sequence of points: def algorithm(self, line) : pass # The various strategies: class LeastSquares(FindMi

Trying LeastSquares algorithm Trying NewtonsMethod algorithm Trying Bisection algorithm [5.5, 6.5999999999999996]

---------------------------------------------------------------------- Genetic Algorithm Toolbox for MATLAB, v1.2 ========================================== Thank you for requesting a copy of t

/* * File: euclid.c * -------------- * This program computes a greates common divisor using * Euclid's algorithm. */ #include #include "genlib.h" #include "simpio.h" /* Function proto

% Genetic Optimization Toolbox % % Main interface % ga.m The Genetic Algorithm % initializega.m Initialization function for float and binary % repres

function [x,esq,j] = kmeanlbg(d,k) %KMEANLBG Vector quantisation using the Linde-Buzo-Gray algorithm [X,ESQ,J]=(D,K) % %Inputs: % D contains data vectors (one per row) % K is number of centres re

---------------------------------------------------------------------- Genetic Algorithm Toolbox for MATLAB, v1.2 ========================================== Thank you for requesting a copy of t

// Program: berlmass.cc --- implement the Berlekamp-Massey algorithm #include "polynomialT.h" template polynomialT berlmass(const T* s, int n) // s = input coefficients s[0],s[1],... s