搜索资源列表
password
- BJ.mID，可以听。放在电脑里可以听，放在MP3和手机里不可以听。-BJ.mID, can be heard. On the computer can listen to on MP3 and cell phone can not listen to.
bj
- 有时间和充沛的体力，再加上对新技术和技巧的学习和应用，你就能为自己在网上建一个家了-Have the time and plenty of physical strength, coupled with new technologies and techniques of learning and application, you will be able to own the Internet to build a home
LCS
- 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 h
bj
- black jack source code, verilog, written in Korean.
BJ
- This game is a demonstration of pulling cards from the cards.dll File. I m not sure who the author of the cards.bas module is but it is off the hook. Kudos to whoever wrote that.
dulirewuzuiyoudiaoduwenti
- 用2 台处理机A 和B 处理n个作业。设第i 个作业交给机器A 处理时需要时间ai，若由机器B来处理，则需要时间bi。由于各作业的特点和机器的性能关系，很可能对于某些i，有ai>=bi，而对于某些j，j≠i，有aj<bj，既不能将一个作业分开由2 台机器处理，也没有一台机器能同时处理2 个作业。设计一个动态规划算法，使得这2 台机器处理完这n个作业的时间最短(从任何一台机器开工到最后一台机器停工的总时间)。 -A processor with 2 sets and B n-jo
hdu3666
- hdu3666 THE MATRIX PROBLEM 你已经拿到了矩阵CN * M,每个元素E * M是积极和拷贝数不超过1000,问题是,如果存在N数字a1,a2,…一个和M数字b1,b2,…,博雅,满足,每个元素在行我乘以ai和每个元素在列j除以bj,此操作后在这个矩阵的每个元素之间是L和U,L表示upperbound下界和U表示这些元素。 -hdu3666 You have been given a matrix CN*M, each element E of CN*M is p
BJ-OMH-innerhouse-map-dataset
- 北京欧美汇商铺的室内地图数据。包含属性数据和矢量数据。-Beijing ECMall shops indoor map data. Contains attribute data and vector data.
bj
- powerbuilder的源码一个带有图片的简单界面-powerbuilder source simple interface with a picture of
bj
- matlab给期权定价的蒙特卡洛模拟，在网上找到的，解压后使用-option pricing montecarlo
MB_OFDM_Transmission
- dfvz sedg esfzsfv zvzd rgdfxbvxd szfc
ran_com_3bj_3bm_01_1114
- 802.3.bj COM计算代码，对通道的性能进行评估(802.3.bj COM computing code Evaluation of channel performance)