7930 search results - page 644 / 1586 » Greedy in Approximation Algorithms |
206
click to vote
ALENEX
2010
15 years 8 months ago
2010
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
182
click to vote
ISCAPDCS
2007
15 years 8 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
172
click to vote
MMNS
2001
15 years 8 months ago
2001
It is widely known that network bandwidth is easily monopolized by distributed multimedia applications due to their greedy UDP traffic. In this paper, we propose TCP-friendly MPEG-...
189
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
170
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Linear inverse problems are very common in signal and image processing. Many algorithms that aim at solving such problems include unknown parameters that need tuning. In this work...