5153 search results - page 293 / 1031 » Introduction to Randomized Algorithms |
128
click to vote
EUROPAR
2003
Springer
15 years 9 months ago
2003
Springer
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
113
Voted
IMA
1995
Springer
15 years 7 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
134
click to vote
FCT
1991
Springer
15 years 7 months ago
1991
Springer
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
125
click to vote
AAAI
1998
15 years 5 months ago
1998
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
155
click to vote
JGAA
2007
15 years 3 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...