Real

旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25

G729的多种编解码，源码。含有测试程序。G729的多种编解码，源码。含有测试程序。

资源描述关于进程调度的操作系统实验的算法，可以点击来看看，进程调度的算法

资源描述操作系统避免死锁算法——银行家算法，通过银行家算法思想解决操作系统避免死锁问题，简单、有效、实用，符合问题要求。

资源描述此源码是日本比较开源流行的一款GSLIB RTK算法完整代码，仅供参考……………………………………

这是一个用java解码哈夫曼树的项目。

基于c#开发的图像自动色阶算法（参照ps）可直接使用

  #include #include #define NULL 0 #include typedef struct Lnode {  int data;  struct Lnode *next; }Josephus; void CreateList(Josephus*&L,int n)//建立循环链表 {  int i;  Josephus *p,*s;  s=(Josephus*)malloc(sizeof(Josephus));  s->data=1;  L=p=s;  for(i=2;idata=i;  p->next=s;  p=s;  }  p->next=L; } void DeleteList(Josephus*&L,Josephus*p,Josephus*q) {  q->next=p->next;  free(p); } void Josephus1(Josephus*&L,int s,int m)

常用算法分析，不用我多说，这绝对是编程的最基本要求-Common algorithms for analysis, I do not have to say, this is absolutely the most basic requirement of programming! ! !

分子动力学的fortran源程序 molecular dynamics microcanonical  ensemble application to argon. the lennard-jones potential is truncated at rcoff and not smoothly continued to zero.  initial the npart particles  are placed on an fcc lattice. the velocities are drawn from a boltzmann distribution with temperature tref.