代码搜索结果

RAR archiver: * RAR introduces an original compression algorithm. It allows higher compression ratios than other PC archiving tools, especially on executable files, object libraries, large

%This code can only be used for research purpose only. %Please cite the following paper if you use it: %L. Zhang and X. Wu, %揂n edge guided image interpolation algorithm via directional filterin

/* rand0.c -- produces random numbers */ /* uses ANSI C portable algorithm */ static unsigned long int next = 1; /* the seed */ int rand0(void) { /* magic formula to

/* s_and_r.c -- file for rand1() and srand1() */ /* uses ANSI C portable algorithm */ static unsigned long int next = 1; /* the seed */ int rand1(void) { /* magic formula to

#ifndef _ALGORITHM_H_ #define _ALGORITHM_H_ #include #include "chunk.h" #include "token.h" #include "dict.h" /** * The Algorithm of MMSeg use four rules: * - Maximum matching rule * -

#include #include using namespace std; int job[110],pri[110]; int main() { int t,n,p,i,j; for(cin>>t;t>0;--t) { cin>>n>>p; for(i=0;i

#include #include using namespace std; int group[102],t,i,result; int less(const int & p,const int & q) { if(p < q) return 1; else return 0; } int main () { cin>>t

#include #include using namespace std; int group[102],t,i,result; int less(const int & p,const int & q) { if(p < q) return 1; else return 0; } int main () { cin>>t;

% test the Sugiyama algorithm % Copyright 1999 by Todd K. Moon p = 3; %p = 2; a1 = 5; a2 = 3; a3 = 2; y0=1; y1=2; y2=-2; a = [a1;a2]; a = [a1;a2;a3]; yv = [y2;y1;y0]; %yv = [y1;y0]; %y

function f = karf(x,c) % % Evaluate the potential function f(x,c) % for karmarkers algorithm % % function f = karf(x,c) % % x = value of x % c = constraint vector % % f = potential function