-
eclipse of the packing problem of Eclipse need not worry about packing jar files...
eclipse的打包问题不用愁 Eclipse打包jar文件教你如何打包文件-eclipse of the packing problem of Eclipse need not worry about packing jar files teach you how to package documents
- 2023-08-20 05:40:03下载
- 积分：1
-
Rich Text Format (. RTF) format on non
富文本格式（。RTF）非可视组件的格式
- 2022-05-20 06:49:51下载
- 积分：1
-
理性的玫瑰网络发行商
Rational Rose web Publisher
- 2023-03-22 11:10:04下载
- 积分：1
-
详细介绍VC++6.0环境下利用WIN API函数来实现与符合HID设备类的USB接口通信...
详细介绍VC++6.0环境下利用WIN API函数来实现与符合HID设备类的USB接口通信-VC++6.0 USB Commutication
- 2022-01-25 23:06:57下载
- 积分：1
-
j2ee核心编程，此书可谓经典之作。
j2ee核心编程，此书可谓经典之作。-j2ee core programming, this book is classic.
- 2022-05-20 08:32:24下载
- 积分：1
-
通过四个控制按钮实现两路输出电压，可以对输出电压进行设定，显示值与输出电压值的误差不超过10mv。并可通过按键实现最高电流设定，进行过流保护。...
通过四个控制按钮实现两路输出电压，可以对输出电压进行设定，显示值与输出电压值的误差不超过10mv。并可通过按键实现最高电流设定，进行过流保护。-Through four control buttons to achieve two output voltage, output voltage can be configured to show the value and the value of the output voltage error is less than 10mv. The maximum current can be achieved through the key settings for overcurrent protection.
- 2022-08-02 10:44:19下载
- 积分：1
-
A* (A
A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。
公式表示为： f(n)=g(n)+h(n),
其中f(n) 是节点n从初始点到目标点的估价函数，
g(n) 是在状态空间中从初始节点到n节点的实际代价，
h(n)是从n到目标节点最佳路径的估计代价。
-A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path.
- 2022-01-25 23:27:36下载
- 积分：1
-
Beej网络指南
Beej s Network Guide.pdf
- 2022-02-03 13:22:15下载
- 积分：1
-
specific date calculation
具体的日期的计算-specific date calculation
- 2022-09-03 20:05:03下载
- 积分：1
-
算法导论习题答案.spring.出版的那本.
算法导论习题答案.spring.出版的那本.-algorithm Introduction to answer the questions. Spring. Which was published in this.
- 2022-08-17 15:26:45下载
- 积分：1
