7930 search results - page 280 / 1586 » Greedy in Approximation Algorithms |
176
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
207
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
182
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
188
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
196
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...