Sciweavers

5580 search results - page 350 / 1116
» Randomized priority algorithms
Sort
View
ROBIO
2006
IEEE
148views Robotics» more  ROBIO 2006»
16 years 1 months ago
A Dynamic MDS-Based Localization Algorithm for Mobile Sensor Networks
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...
Changhua Wu, Weihua Sheng, Wen-Zhan Song
EUROPAR
2003
Springer
16 years 11 days ago
A Parallel Algorithm for Incremental Compact Clustering
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...
Reynaldo Gil-García, José Manuel Bad...
IMA
1995
Springer
97views Cryptology» more  IMA 1995»
15 years 10 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
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...
Anne Canteaut
186
Voted
FCT
1991
Springer
15 years 10 months ago
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
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...
Claus-Peter Schnorr, M. Euchner
184
Voted
AAAI
1998
15 years 8 months ago
Optimal 2D Model Matching Using a Messy Genetic Algorithm
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...
J. Ross Beveridge