java server program,講述java服務(wù)器端編程
標(biāo)簽： java program server 服務(wù)器
上傳時間： 2013-12-23
上傳用戶：xg262122
Teach Yourself Shell Program，shell 入門 建議
標(biāo)簽： Yourself Program Teach Shell
上傳時間： 2013-12-15
上傳用戶：kbnswdifs
ohly an c program could you give me
標(biāo)簽： program could ohly give
上傳時間： 2015-07-10
上傳用戶：電子世界
Oracle PL/SQL Best Practices is a concise, easy-to-use summary of best practices in the program development process. It covers coding style, writing SQL in PL/SQL, data structures, control structures, exception handling, program and package construction, and built-in packages.
標(biāo)簽： easy-to-use Practices practices concise
上傳時間： 2015-07-11
上傳用戶：gonuiln
8051 monitor programm: - use external ram to run user program - use eeprom to save user program - provide single step debug, can read internal register and ram
標(biāo)簽： program user use external
上傳時間： 2015-07-11
上傳用戶：zhichenglu
一個條碼生成程序及源程序 帶算法 39條碼 EAN13條碼- A bar code production procedure and source program belt algorithm 39 bar codes EAN13 bar code ,Delphi,GDI/
標(biāo)簽： production algorithm procedure program
上傳時間： 2013-12-30
上傳用戶：xiaohuanhuan
A program to find frequent molecular substructures and discriminative fragments in a database of molecule descriptions. The algorithm is based on the Eclat algorithm for frequent item set mining.
標(biāo)簽： discriminative substructures fragments molecular
上傳時間： 2014-01-20
上傳用戶：龍飛艇
A program to demonstrate the optimization process of particle swarm optimization. A two-dimensional objective function is visualized by level of grey: the lighter the color, the higher the function value. The particles are shown as red circles, their trajectory as red lines.
標(biāo)簽： optimization two-dimensional demonstrate particle
上傳時間： 2013-12-22
上傳用戶：Andy123456
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
標(biāo)簽： optimization demonstrate the traveling
上傳時間： 2015-07-12
上傳用戶：偷心的海盜
A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists.
標(biāo)簽： algorithm frequent itemsets program
上傳時間： 2013-12-27
上傳用戶：ouyangtongze
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
