5580 search results - page 769 / 1116 » Randomized priority algorithms |
104
Voted
FCT
2005
Springer
15 years 9 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
136
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
116
Voted
GRID
2005
Springer
15 years 9 months ago
2005
Springer
Large latencies over WAN will remain an obstacle to running communication intensive parallel applications on Grid environments. This paper takes one of such applications, Gaussian...
125
Voted
HIPC
2005
Springer
15 years 9 months ago
2005
Springer
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is ...
128
Voted
ICICS
2005
Springer
15 years 9 months ago
2005
Springer
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...