搜索结果

This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseudo-random irregular low density parity check matrix is based on Radford M. Neal’s programs collection, which can be found in [1]. While Neal’s collection is well documented, in my opinion, C source c ...

This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseudo-random irregular low density parity check matrix is based on Radford M. Neal’s programs collection, which can be found in [1]. While Neal’s collection is well documented, in my opinion, C source c ...

一定要在TC下运行，需要包括一些头文件，如graphic.h 要求：画一辆小车不停地水平从屏幕左边运动到右边，随着每一遍运动，小车高度均匀下降，降到最低后返回最高处 相关函数：delay(),kbhit(),lineto(),moveto(),arc(),circle()等。

The idea behind differential GPS is to remove as much errors as possible from the range measurements by establishing these errors at a reference site. In its most simple setup, a GPS receiver is located at a well surveyed position and its (pseudo) range measurements are compared with the actual calc ...

AMOP 0.3 is an Automatic Mock Object for C++. By using ABI and template techniques, it can simulate a pseudo-"Reflection" which is normally not support in C++ . The main differences between AMOP and other mock object library is that, users DO NOT need to implement the interface of the object which ...

高级C语言源程序范例 Source Code from Que publications "Advanced C" Techniques and Aplications ISBN 0-88022-162-3 Advanced C Techniques and Applications QUE Unpack into a directory with the following structure root - Contents of this arc. root/bgs Contents of BGS.arc root/uis Contents ...

Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a const ...

Some thesis studies about wireless sensor network algorithms. Algorithms are considered and some pseudo codes are shown.

Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The n ...

void DFS(MGraph G, int i) {     int j;     visited[i] = TRUE;     printf("%c ",    G.vexs[i]);     for (j=0; j<G.numVertexes; ++j)     {         if (G.arc[i][j]!=INFINITY  &&  !visited[j])       ...