Bodo Manthey

Computer Science

1. Algorithms 100%
2. Heuristics 87%
3. Models 81%
4. Short Path 61%
5. Approximation Ratio 54%
6. Traveling Salesman Problem 54%
7. Polynomial Time 51%
8. Standards 40%
9. Search Heuristic 40%
10. Iterations 34%
11. Geometric Graph 30%
12. Wireless Networks 30%
13. Clustering Algorithm 30%
14. Complexity 29%
15. Analysis of Algorithms 28%
16. Directed Graphs 20%
17. Approximate Solution 20%
18. Independent Set 20%
19. Location Problem 20%
20. Probabilistic Analysis 20%
21. k-means Clustering 20%
22. Squared Euclidean Distance 20%
23. min-sum algorithm 20%
24. Polynomial Algorithm 17%
25. Gaussian Noise 15%
26. Relative Entropy 15%
27. Greedy Heuristic 14%
28. Application 14%
29. Approximation (Algorithm) 12%
30. approximation scheme 12%
31. Classes 12%
32. Maximum Matching 11%
33. Combinatorial Optimization Problem 10%
34. Random Position 10%
35. Belief Propagation 10%
36. Dimensional Space 10%
37. Quicksort 10%
38. Complexity Class 10%
39. Binary Search Tree 10%
40. Typical Example 10%
41. Simplex Algorithm 10%
42. Local Search Algorithm 10%
43. Distance Measure 10%
44. Related Document 10%
45. closed-form expression 10%
46. Metric Space 9%
47. Minimum Distance 9%
48. Time Approximation Scheme 7%
49. Triangle Inequality 7%
50. Probability 7%