Algorithms are the foundation of modern computing. They help computers solve problems, process data, and make decisions efficiently. Understanding the different types of algorithms is an important ...

The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...

Abstract: To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack ...

Abstract: Knapsack problem is a classical optimization problem in computer science and programming. Knapsack problem main objective is to solve how much the maximum profit can be carried with the ...

Aug 2: I'll have 2-hour office hours on Wed, Aug 7, 11:30-13:30. Aug 2: The final exam on Aug 9 will be on all topics of the course, with equal emphasis. You'll have 3 hours for an exam that will be ...

The question A is about the Peano curve, which is the advanced level of Hilbert curve, quite interesting. The question B is the application of segment Tree, which is ...