3208 search results - page 425 / 642 » A Lower Bound for Primality |
190
click to vote
RTSS
2009
IEEE
16 years 1 months ago
2009
IEEE
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
172
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
178
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
194
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
176
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...