byleimin 在 2009-01-21 21:54:23 上传
开发平台:Visual C++ | 大小:19KB | 下载31次
byleimin 在 2009-01-21 21:52:51 上传
开发平台:matlab | 大小:3KB | 下载22次
刘铮 在 2009-01-21 21:23:38 上传
说明:TI DSP TMS320LF2407A与USB接口68001的通讯程序
开发平台:C-C++ | 大小:39KB | 下载21次
s 在 2009-01-21 18:56:00 上传
开发平台:Java | 大小:14KB | 下载3次
limiao 在 2009-01-21 17:51:07 上传
开发平台:C++ | 大小:3KB | 下载4次
palmer 在 2009-01-21 11:39:52 上传
说明:Python 学习的一些资料。这种语言功能强大,很有前途,有兴趣可以看看!
开发平台:Python | 大小:1770KB | 下载18次
汪平 在 2009-01-21 09:31:12 上传
开发平台:HTML | 大小:227KB | 下载2次
junli 在 2009-01-21 09:21:43 上传
说明:国外经典幻灯片:快乐的十八种技巧,Send SNOOPY to your friends,等提高生活品质
开发平台:PPT | 大小:7987KB | 下载2次
王来 在 2009-01-20 22:49:43 上传
开发平台:Visual C++ | 大小:697KB | 下载22次
xt 在 2009-01-20 22:14:20 上传
开发平台:Visual C++ | 大小:1569KB | 下载42次
歐明 在 2009-01-20 20:52:28 上传
开发平台:Others | 大小:2439KB | 下载1次
xiaowei 在 2009-01-20 20:32:57 上传
开发平台:Java | 大小:50KB | 下载1次
Grand Chen 在 2009-01-20 19:07:16 上传
开发平台:C++ Builder | 大小:12KB | 下载3次
张姓 在 2009-01-20 17:13:29 上传
说明:Python核心编程第二版.pdf Python核心编程第二版.pdf
开发平台:Python | 大小:4891KB | 下载10次
上官 在 2009-01-20 15:57:27 上传
开发平台:HTML | 大小:1KB | 下载3次
上官 在 2009-01-20 15:49:12 上传
开发平台:HTML | 大小:1KB | 下载1次
wai 在 2009-01-20 14:51:51 上传
说明:hough transformation
开发平台:Visual C++ | 大小:1264KB | 下载2次
杨慧琪 在 2009-01-20 14:42:15 上传
开发平台:matlab | 大小:2KB | 下载107次
linru 在 2009-01-20 12:24:51 上传
说明:Program uses a 2-D dynamic array to store any number of sets of randomly generated LOTO 6/49 numbers. Simulation signed Lotto
开发平台:C++ | 大小:2KB | 下载10次
linru 在 2009-01-20 12:16:19 上传
说明:A heap is a binary tree satisfying the following conditions: 􀂄 This tree is completely balanced. 􀂄 If the height of this binary tree is h, then leaves can be at level h or level h-1. 􀂄 All leaves at level h are as far to the left as possible. 􀂄 The data associated with all descendants of a node are smaller than the datum associated with this node.
开发平台:C++ | 大小:1KB | 下载2次
linru 在 2009-01-20 12:15:09 上传
说明:Huffman codes 􀂄 In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? 􀂄 To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. 􀂄 This problem can by solved by using an extended binary tree which is used in the 2- way merging problem.
开发平台:C++ | 大小:1KB | 下载1次
linru 在 2009-01-20 12:13:12 上传
说明:Instead of finding the longest common subsequence, let us try to determine the length of the LCS. 􀂄 Then tracking back to find the LCS. 􀂄 Consider a1a2…am and b1b2…bn. 􀂄 Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. 􀂄 Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn 􀂄 Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. 􀂄 Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
开发平台:C++ | 大小:1KB | 下载3次
linru 在 2009-01-20 12:10:33 上传
说明:The basic principle using the branchand- bound strategy to solve the traveling salesperson optimization problem (TSP) consists of two parts. 􀂄 There is a way to split the solution space. 􀂄 There is a way to predict a lower bound for a class of solutions. 􀂄 There is also a way to find an upper bound of an optimal solution. 􀂄 If the lower bound of a solution exceeds this upper bound, this solution cannot be optimal. Thus, we should terminate the branching associated with this solution.
开发平台:C-C++ | 大小:2KB | 下载1次
linru 在 2009-01-20 12:08:55 上传
说明:Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
开发平台:Others | 大小:2KB | 下载12次
wbz 在 2009-01-20 11:54:33 上传
说明:3D 选号机 可以按自已的意图,选取或去掉不想要的号码,缩小可选范围
开发平台:VFP | 大小:249KB | 下载12次
she 在 2009-01-20 11:18:23 上传
开发平台:matlab | 大小:1KB | 下载97次
xinglong_li 在 2009-01-20 11:03:02 上传
说明:visual c++ 简单程序 关于MFC 开发
开发平台:Visual C++ | 大小:1845KB | 下载68次
lulyon 在 2009-01-20 10:35:45 上传
开发平台:CHM | 大小:1021KB | 下载90次
Erison 在 2009-01-20 10:09:41 上传
说明:This book uses the Python language to teach pro - gramming concepts and problem -solving skills, without assuming any previous program- ming experience. With easy-to-understand examples, pseudocode, flowcharts, and other tools, the student learns how to design the logic of programs and then implement those programs using Python. This book is ideal for an introductory programming course or a programming logic and design course using Python as the language. As with all the boolts in the Starting Out With series, the hallmark of this text is its clear, friendly, and easy -to-understand writing. In addition, it is rich in example programs that are concise and practical. The programs in this book include short examples that highlight specific programming topics, as well as more involved examples that focus on problem solving. Each chapter provides one or more case studies that provide step -by-step analysis of a specific problem and shows the student how to solve it.
开发平台:Python | 大小:31104KB | 下载44次
张磊 在 2009-01-20 09:37:26 上传
说明:用C实现鼠标器 调试环境为TC 2.0
开发平台:C-C++ | 大小:24KB | 下载3次