1382 search results - page 47 / 277 » Formal Analysis of Online Algorithms |
200
click to vote
FORTE
1994
15 years 7 months ago
1994
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
128
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
162
Voted
IWNAS
2008
IEEE
16 years 5 days ago
2008
IEEE
∗ As one type of stealthy and hard-to-detect attack, lowrate TCP-targeted DDoS attack can seriously throttle the throughput of normal TCP flows for a long time without being noti...
134
Voted
APL
1993
ACM
15 years 10 months ago
1993
ACM
: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is r...
177
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...