No self-introduction
Loading
Profile
Follow
codes (3)
Netctoss Telecom Billing HTML
no vote
Telecom Billing HTML for Java projects. Code code code code code code code code code code code code code code
bbojus46 0 0
1
Ant colony algorithm traveling salesman problem
no vote
Traveling salesman problem (TSP). Suppose a traveling salesman wants to visit 31 cities, and he needs to choose the route he wants. The limit of the route is that each city can only visit once, and finally return to the original city. Path selection requires that the distance of the selected path is the minimum of all paths. &Nbsp; the coordinates of 31 cities are [130 4 2 3 12; 36 3 9 13 15, 4 17 7 2 4 4; 37 12 13 9 93, 4 8 15 3 5; 33 2 6 15 5 6; 32 3 8 12 2 9; 4 19 6 100 4, 4 3 12 7 9 0, 4 3 8 6 5 7 0; 30 0 7 19 7 0; 25 6 217 5 6; 27 8 14 9 1, 2 38 1 16 7 6; 13 3 2 6 9 5; 3 7 15 16 7 8; 3 9 18 2 17 9, 41; 29 3 5 3 2 4 0; 3 14 0 3 5 5 0; 2 5 The simulation process is as follows: (1) the number of initialization ants M = 50, the pheromone importance parameter alph
bbojus46 0 0
1
viterbi algorithm
no vote
The (7,1 / 2) convolutional coding and the software implementation of Viterbi decoding algorithm are introduced and analyzed in detail
bbojus46 0 0
1
No more~
Follows0
Fans0