人工智能中的有关Wumpus世界的源程序 功能非常强大

c# 聊天程序的服务端-procedures chat server

小型计数器。可以计算简单的“+、-、*、/...”-Small counter. Can calculate a simple

综合实验源代码－世界时钟|综合实验源代码－世界时钟-Comprehensive Experiment source code- World Clock | Integrated Experimental source code- World Clock

虚拟魔方,大家充分怀念c语言的精粹吧-virtual Rubik"s cube, we fully c miss the essence of language it

图像压缩问题要求确定象素序列{p1,p2,…,pn}的最优分段，使得依此分段所需的存储空间最少。每个分段的长度不超过256位。数字化图像是m×m的像素阵列。假定每个像素有一个0 ~ 2 5 5的灰度值。因此存储一个像素至多需8位。若每个像素存储都用最大位8位，则总的存储空间为8m^2 位。为了减少存储空间，我们将采用变长模式（ variable bit scheme），即不同像素用不同位数来存储。像素值为0和1时只需1位存储空间； 值2、3各需2位；值4，5，6和7各需3位；以此类推。-image compression defined pixel sequence (p1, p2, ..., pn) sub-optimal, sub accordingly makes the storage space required at least. The length of each section is not more than 256. The digital image is m m pixel arrays. Assume that each pixel is a 0-2 5 5 of the gray values. Therefore storage of up to a pixel 8. If each pixel with the largest storage capacity of 8-bit, the total storage space for 8m ^ 2. In order to reduce storage space, and we will use variable-length model (variable bit scheme), that is different with different pixel median storage. Pixel values of 0 and 1 and only a storage space; The value of 2,3 required two; Value 4,5,6 and 7 of the required three; Analogy.

一个简单的树形程序-a simple procedure tr

片上网络 容错路由算法源代码-Noc

在状态栏中显示时间-the status bar shows the time

单像后方交会，摄影测量空间后方交会使用，具体的功能需要的人自然知道-Single-like resection, photogrammetric space resection using the specific function of the natural need to know

这是自己花了好长时间在网上找的一个关于串口通信的程序，适合初学者，网址可能忘记了，但是把自己下载好的代码与大家共享，希望有用