搜索资源列表
2142
- 寻最小支配集,用DP,复杂度是2^8 比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker
dp
- dp问题的讲解，动态规划的定义应用等等，主要对于竞赛做题的应用。
2385_DP
- ACM pku 2385 解题报告 DP题
contest
- 一次比赛的代码,有五道题,2,4比较基础,3题是模拟,1高精度,5树状dp
Profibus-DP-zz
- profibus-dp主站源代码，驱动，开发环境C
Travel_Planning_Problem
- 使用Floyd-Warshall最短路径及TSP的DP法解旅游规划问题
TXButton
- TXButton ........\TXButton.dcu ........\TXButton.pas ........\TXButton.~pas ........\TXButtonPack.cfg ........\TXButtonPack.dcu ........\TXButtonPack.dof ........\TXButtonPack.dpk ........\TXButtonPack.res ........\TXButton
TCWTXT
- Example rawsniffer -p TCP -dp 25,110 -o f1,txt -m -sniffpack,(Example rawsniffer -p TCP - dp 25110 - o f1, TXT - m - sniffpack,)
plc实现0-50HZ循环
- plc profibus dp 通讯()
53063581
- profibus -dp slaves test specification 应用手册 PROCESS FIELD BU()