搜索结果
找到约 1,987 项符合
asm-all 的查询结果
汇编语言 汇编语言编写的实时时钟程序 比较简单 后缀为asm
汇编语言编写的实时时钟程序
比较简单
后缀为asm
编译器/解释器 // Copyright (c), Philips Semiconductors Gratkorn // (C)PHILIPS Electronics N.V.2000 // All rights
// Copyright (c), Philips Semiconductors Gratkorn
// (C)PHILIPS Electronics N.V.2000
// All rights are reserved.
// Philips reserves the right to make changes without notice at any time.
// Philips makes no warranty, expressed, implied or statutory, including but
// not limited to any implied warra ...
多国语言处理 broad cast could send the message to all the user from the im server, which is one module of the ope
broad cast could send the message to all the user from the im server, which is one module of the openfire,
其他书籍 一个关于DOS使用的文档,很全面,对于新手很是有用.-DOS use common sense on a very comprehensive documentation, I believe all
一个关于DOS使用的文档,很全面,对于新手很是有用.-DOS use common sense on a very comprehensive documentation, I believe all of us are also used.
数学计算 2. Using QR factorization to find all of the eigenvalues and eigenvectors for the following matrix
2. Using QR factorization to find all of the eigenvalues and eigenvectors for the following matrix
汇编语言 his header file that is used to define all preprossor directives, global variables, and prototype
his header file that is used to define all preprossor directives,
global variables, and prototypes.
The user must modify this header file for their particular Bridge Transducer
in use before proceeding.
单片机开发 8路红外遥控开关控制器 (SAA3010T电视遥控器) Copyright 2004/3/27 http://www.cdle.net http://bbs.cdle.net All
8路红外遥控开关控制器
(SAA3010T电视遥控器)
Copyright 2004/3/27
http://www.cdle.net
http://bbs.cdle.net
All rights reserved.
明浩 E-mail: pnzwzw@163.com
pnzwzw@cdle.net
只用八路时可以用AT89C2051代替AT89C51
一体化接收头输出端拉P3.2(int0),P1为控制输出端。
可以扩展到32路或更多
输出为 ...
软件设计/软件工程 Philips D12 all the data
Philips D12 all the data
单片机开发 51单片机底层开发人员的有力武器。 ASM文档
51单片机底层开发人员的有力武器。
ASM文档,包含所有内部资源运用。
书籍源码 Floyd-Warshall算法描述 1)适用范围: a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述: a)初始化:d
Floyd-Warshall算法描述
1)适用范围:
a)APSP(All Pairs Shortest Paths)
b)稠密图效果最佳
c)边权可正可负
2)算法描述:
a)初始化:dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法结束:dis即为所有点对的最短路径矩阵
3)算法小 ...