登录
首页 » Visual C++ » X_bit0mintest

X_bit0mintest

于 2011-07-02 发布 文件大小:1055KB
0 228
下载积分: 1 下载次数: 4

代码说明:

  X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Graph
    数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
    2013-11-28 10:53:29下载
    积分:1
  • bookmanage
    基于数据结构的图书管理系统,基本功能都有,可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)
    2020-10-27 00:00:04下载
    积分:1
  • Hash
    基于Hash表的程序同源性分析,可以利用本程序进行两个程序源码比较相似度(Homology analysis Hash Table-based program, you can use the program two program source code similarity)
    2012-11-04 16:45:04下载
    积分:1
  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • SelectSort
    选择排序的实现,是一种基本的排序方法,但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
    2012-09-27 22:38:22下载
    积分:1
  • dijkstra
    dijkstra算法,用于寻找已建立图的最短路径,是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)
    2007-07-15 14:14:48下载
    积分:1
  • josephus
    说明:  约瑟夫算法,适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)
    2011-04-13 16:43:47下载
    积分:1
  • fibonacci-heap
    斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
    2013-09-17 18:02:59下载
    积分:1
  • chess
    在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)
    2009-06-01 11:21:39下载
    积分:1
  • Untitled
    航迹起始中的逻辑航迹起始算法源代码,本代码具有很好的航迹起始效果! (Track initiation logic for track initiation algorithm source code, this code has the effect of track initiation)
    2012-06-06 21:35:20下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载