We present on O(n log n) greedy algorithm with a worst-case performance ratio > 4 for the unbounded knapsack problem, an O(n log n) greedy algorithm with a worst-case performance ratio of ~ for the subset-sum problem, and an O(n log n) greedy algorithm with a worst-case performance ratio of ~for the partition problem. These greedy algorithms, in the sense of worst-case performance, are better t...

The iterated diierence of polyhedra V = P1n(P2n independently in 11] and 7] as a suucient condition for V to be exactly computable by a two-layered neural network. An algorithm checking whether V I R d is an iterated diierence of polyhedra is proposed in 11]. However, this algorithm is not practically usable because it has a high computational complexity and it was only conjectured to stop with...

Iterative approximation algorithms are successfully applied in parametric approximation tasks. In particular, reduced basis methods make use of the so called Greedy algorithm for approximating solution sets of parametrized partial differential equations. Recently, a-priori convergence rate statements for this algorithm have been given (Buffa et al 2009, Binev et al. 2010). The goal of the curre...

In 1999, S. V. Konyagin and N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting useful characterizations of greedy-type bases in Banach spaces. this article, we study extend several greedy almost literature. Along way, give various examples to complement our main results. Furthermore, propose a new version Weak Algorithm (WTGA) show ...

The scheduling of agile Earth observation satellites is to select a subset candidate targets each associated with profit during their visible time windows in order maximize the collected profits, under some operational constraints. For pair two consecutive observations, transition required perform rotating movement camera, depending on start times observations. This time-dependency significantl...