Sciweavers

2642 search results - page 193 / 529
» Merge-by-Wire: Algorithms and System Support
Sort
View
SIGCOMM
2010
ACM
15 years 6 months ago
DONAR: decentralized server selection for cloud services
Geo-replicated services need an effective way to direct client requests to a particular location, based on performance, load, and cost. This paper presents DONAR, a distributed sy...
Patrick Wendell, Joe Wenjie Jiang, Michael J. Free...
VLDB
2007
ACM
129views Database» more  VLDB 2007»
16 years 17 days ago
Processing Forecasting Queries
Forecasting future events based on historic data is useful in many domains like system management, adaptive query processing, environmental monitoring, and financial planning. We...
Songyun Duan, Shivnath Babu
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
16 years 7 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
16 years 19 days ago
ECGA vs. BOA in discovering stock market trading experts
This paper presents two evolutionary algorithms, ECGA and BOA, applied to constructing stock market trading expertise, which is built on the basis of a set of specific trading ru...
Piotr Lipinski
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
16 years 15 days ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...