High dimensional approximation of the smallest ball coverage

Abstract

Related Dissertations

1. Based on the core set of examples of attribute reduction method,O159
2. Service level constraints parallel machine scheduling problem,O223
3. A Study on Algorithm for Classification Based on Support Vector Data Description,TP181
4. Some Scheduling Problem in Production Management,O223
5. Cost of the machine with reject scheduling problem,O223
6. Graph coloring problem applied research,O157.5
7. Tree Algorithm for Traveling Salesman Problem,TP301.6
8. Routing in Counter Rotated SONET Ring with Load Restriction,TN929.1
9. Minimizing Makespan and Maximum Lateness on Batching Machine,O223
10. Compatibility constraints with single parallel batch scheduling problem,O223
11. Approximation algorithm Nesting Optimization,O224
12. Research on Algorithms for Channel Assignment in Mobile Communication System,TN929.5
13. The Research of Fuzzy Interpolative Reasoning Method Based on the Sparse Fuzzy Rule Bases,TP301
14. Research on Some Problems of Bin Coloring,O22
15. Scheduling in Wireless Networks with Multiple Packet Reception,TN929.5
16. Study on Approximation Algorithms for Some Class of Geometry Optimization Problem,O224
17. Research on Broadcast and Data Aggregation Algorithms in Wireless Ad Hoc Networks,TN929.5
18. Research on Flexible Open Shop Scheduling Algorithm,TH186
19. The domination sets of some of the issues related to research,O157.5
20. Several algorithm design cutting-edge issues,TP301.6