Sciweavers

390 search results - page 32 / 78
» When is an estimation of distribution algorithm better than ...
Sort
View
IPSN
2004
Springer
14 years 23 days ago
Distributed online localization in sensor networks using a moving target
We describe a novel method for node localization in a sensor network where there are a fraction of reference nodes with known locations. For application-specific sensor networks, ...
Aram Galstyan, Bhaskar Krishnamachari, Kristina Le...
BIOINFORMATICS
2007
123views more  BIOINFORMATICS 2007»
13 years 7 months ago
A comparative genome approach to marker ordering
Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The in...
Thomas Faraut, Simon de Givry, Patrick Chabrier, T...
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
14 years 1 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 7 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
BMCBI
2008
111views more  BMCBI 2008»
13 years 7 months ago
GENOMEPOP: A program to simulate genomes in populations
Background: There are several situations in population biology research where simulating DNA sequences is useful. Simulation of biological populations under different evolutionary...
Antonio Carvajal-Rodríguez