代码搜索结果
找到约 33,766 项符合
Algorithm 的代码
fastica_2.5说明.txt
The FastICA package for MATLAB
The FastICA package is a free (GPL) MATLAB program that implements the fast fixed-point algorithm for independent component analysis and projection pursuit. It features
2001.cpp
#include
#include
#include
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
string a,b;
cin>>a>>b;
if(b.length()
1554.cpp
#include
#include
#include
#include
using namespace std;
void deal(string s,int p,string & res){
int e=(s.length()-p)/2,int n=1;
for(int i=e;i>p;i++){
mexgraphhits.m
function PageRank = mexGraphHITS(Graph, Iterations, Direction, ShowProgress)
% Implements the HITS(????) algorithm on the Graph. The algorithm computes interactively HUBS and AUTHORITIES indeces fo
tank.m
% Author: Housam Binous
% Dynamic and control of a tank using the genetic algorithm toolbox
% National Institute of Applied Sciences and Technology, Tunis, TUNISIA
% Email: binoushousam@yahoo
obj2.m
% Author: Housam Binous
% Dynamic and control of a tank using the genetic algorithm toolbox
% National Institute of Applied Sciences and Technology, Tunis, TUNISIA
% Email: binoushousam@yahoo
convsys.m
function [Ao,Bo,Co,Do]=convsys(A1,B1,C1,D1,A2,B2,C2,D2)
%
% [Ao,Bo,Co,Do]=convsys(A1,B1,C1,D1,A2,B2,C2,D2)
%
% This algorithm gives the convolution of two state space representations
%
%
2561.cpp
#include
#include
using namespace std;
int main()
{
int n,m,i,j,k,t[1005];
while(scanf("%d",&n)!=EOF)
{
while(n--)
{
scanf("%d",&m);
for(i=0;i
2.txt
#include
#include
#include
using namespace std;
// Floyd's All pairs shortest path algorithm (O (n^3) )
// input is adjacency matrix output is matrix of shortest
进制转换.cpp
#include
#include
#include
using namespace std;
void main()
{
long long e;
int a[100],j=0,k,n=0;
char s[100];
cin>>e;
cin>>k;
while(e)
{
a[n++]=