AVL Tree implementation: I also included a test function to compare the AVL Tree performance with STL Set and Map. Compile the source mavltree.cpp and run it to see the result!
標簽： Tree implementation performance AVL
上傳時間： 2013-12-19
上傳用戶：3到15
Rom Backup Tool for PPC, be sure to backup all data before use this tools
標簽： Backup backup before tools
上傳時間： 2013-12-09
上傳用戶：lijianyu172
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
上傳時間： 2015-07-11
上傳用戶：zhichenglu
update patch to linux kernel 2.6.18-git15
上傳時間： 2014-01-27
上傳用戶：youlongjian0
update patch to linux kernel to 2.4.34-pre3
上傳時間： 2013-12-26
上傳用戶：磊子226
this code show how to use computer sole the poblem to piece image together
標簽： computer together poblem piece
上傳時間： 2015-07-12
上傳用戶：330402686
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.
標簽： 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.
標簽： 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.
標簽： 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.
標簽： algorithm frequent itemsets program
上傳時間： 2013-12-27
上傳用戶：ouyangtongze
