2485 search results - page 216 / 497 » Time Bounded Frequency Computations |
170
click to vote
RTCSA
2006
IEEE
16 years 17 days ago
2006
IEEE
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
163
click to vote
ICTCS
2005
Springer
16 years 2 days ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
165
click to vote
COMPGEOM
1999
ACM
15 years 11 months ago
1999
ACM
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
141
click to vote
MST
2006
15 years 6 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
163
click to vote
STACS
2007
Springer
16 years 20 days ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...