1982 search results - page 115 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
144
click to vote
ISPD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
135
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
126
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Record linkage is an important data integration task that has many practical uses for matching, merging and duplicate removal in large and diverse databases. However, a quadratic ...
138
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
133
click to vote
SIGADA
2001
Springer
15 years 8 months ago
2001
Springer
The last years have seen an increasing, albeit restricted simulation of large-scale networks on shared memory parallel platforms. As the complexity of communication protocols and ...