3208 search results - page 498 / 642 » A Lower Bound for Primality |
168
click to vote
SOFSEM
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
149
click to vote
SOFSEM
2007
Springer
16 years 18 days ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
163
click to vote
VLDB
2007
ACM
16 years 18 days ago
2007
ACM
An increasing number of enterprises outsource their IT services to third parties who can offer these services for a much lower cost due to economy of scale. Quality of service is ...
155
click to vote
WADS
2007
Springer
16 years 18 days ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
151
click to vote
WADS
2007
Springer
16 years 18 days ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...