Sciweavers

5153 search results - page 685 / 1031
» Introduction to Randomized Algorithms
Sort
View
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
15 years 10 months ago
Constant generation for the financial domain using grammatical evolution
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...
Ian Dempsey
GRID
2005
Springer
15 years 10 months ago
Highly latency tolerant Gaussian elimination
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...
Toshio Endo, Kenjiro Taura
HIPC
2005
Springer
15 years 10 months ago
Scheduling Multiple Flows on Parallel Disks
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 ...
Ajay Gulati, Peter J. Varman
ICICS
2005
Springer
15 years 10 months ago
Private Itemset Support Counting
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...
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
PCI
2005
Springer
15 years 10 months ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris