315 search results - page 50 / 63 » Are Multiple Runs of Genetic Algorithms Better than One |
DEXAW
2003
IEEE
14 years 4 months ago
2003
IEEE
We present the framework of a new grid architecture based on the peer-to-peer and the component paradigms. In our architecture, several peer-to-peer components are loosely coupled...
BIOCOMP
2007
14 years 7 days ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
CGF
2010
13 years 11 months ago
2010
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
JCSS
2007
13 years 10 months ago
2007
The financial services industry today produces and consumes huge amounts of data and the processes involved in analysing these data are equally huge especially in terms of their c...
MCS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...