223 search results - page 28 / 45 » Proving Termination by Bounded Increase |
192
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
76
Voted
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the ...
JSAC
2010
14 years 8 months ago
2010
Abstract—In high density perpendicular magnetic recording channels, nonlinear transition shift (NLTS) is one of the distortions that can degrade the system performance. Write pre...
73
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
67
Voted
JCT
1998
14 years 9 months ago
1998
For k > 2 and r ≥ 2, let G(k, r) denote the smallest positive integer g such that every increasing sequence of g integers {a1, a2, . . . , ag} with gaps aj+1 − aj ∈ {1, ....