The ATA algorithm provides a novel approximation framework for analytic functions that cannot be expressed in closed-form via elementary or algebraic functions. It introduces a hybrid approximation ...

The Traveling Salesman Problem (TSP) is a well-known problem in optimization, where the objective is to find the shortest route to visit all cities and return to the starting point. This project ...

1 Key Laboratory of Smart Grid of Ministry of Education, Tianjin University, Tianjin, China 2 State Grid Economic and Technological Research Institute Co., Ltd., Beijing, China The optimal operation ...

The expectation-maximization (EM) algorithm is a powerful computational technique for locating maxima of functions. It is widely used in statistics for maximum likelihood or maximum a posteriori ...

Abstract: Scheduling task graphs with communication delay is a widely studied NP-hard problem. Many heuristics have been proposed, but there is no constant approximation algorithm for this classic ...

Abstract: In scheduling theory, the non-preemptive scheduling on a single machine of jobs with increasing processing times and release dates for total completion time minimization is known to be a ...