Sciweavers

1628 search results - page 83 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
JPDC
2007
191views more  JPDC 2007»
15 years 4 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
140
Voted
BIODATAMINING
2008
85views more  BIODATAMINING 2008»
15 years 4 months ago
A review of estimation of distribution algorithms in bioinformatics
Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformati...
Rubén Armañanzas, Iñaki Inza,...
SYRCODIS
2008
136views Database» more  SYRCODIS 2008»
15 years 5 months ago
Stochastic Approach to Binary Matrix Partitioning for Phylogenetic Networks
In this research we introduce the problem of the binary matrix partitioning in a biological context. Our idea is to use SNP matrix to construct a set of phylogenetic networks to r...
Victoria Kusherbaeva, Nikolay Vyahhi
COCOON
2007
Springer
15 years 10 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
16 years 5 months ago
A Partition-Based Approach to Graph Mining
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
Junmei Wang, Wynne Hsu, Mong-Li Lee, Chang Sheng