-
-
-
-
[
Java/JSP]
javaAG.rar
Unconstrained conditions max f (x1, x2) = 21.5+ X1* sin (4* pi* x1)+ X2sin (20* pi* x2)-3.0 <x1 <12.14.1 <x2 <5.81 of variation 25 cross-rotating wheel selection
-
[
Visual C++ (VC++)]
lafeng.rar
... the process of DIY article 11 of the file transfer a frame structure and interface programming to achieve Trojan DIY section 12 of the file transfer function to achieve two Trojan programming DIY section 13 of the file transfer three breakpoints Continued ...
-
[
Visual C++ (VC++)]
11111111111.rar
... teaching materials. Chapter 1 Chapter 9 for most undergraduate courses a semester data structures provided sufficient material. Multi-hours courses can be taught in Chapter 10. Algorithm Analysis postgraduate courses can use the first 6 to 12 chapters.
-
-
-
-
-