Sciweavers

868 search results - page 140 / 174
» Finding Most Likely Solutions
Sort
View
KES
1999
Springer
13 years 12 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
CASCON
1997
91views Education» more  CASCON 1997»
13 years 9 months ago
Keeping virtual information resources up and running
The maintenanceofmaterializedviews in largescale environments composed of numerous heterogeneous information sources ISs, such as the WWW, has importance for the new breed of in...
Amy J. Lee, Anisoara Nica, Elke A. Rundensteiner
BMCBI
2006
160views more  BMCBI 2006»
13 years 7 months ago
MIMAS: an innovative tool for network-based high density oligonucleotide microarray data management and annotation
Background: The high-density oligonucleotide microarray (GeneChip) is an important tool for molecular biological research aiming at large-scale detection of small nucleotide polym...
Leandro Hermida, Olivier Schaad, Philippe Demougin...
INFOCOM
2008
IEEE
14 years 2 months ago
Complex Network Measurements: Estimating the Relevance of Observed Properties
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
Matthieu Latapy, Clémence Magnien
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
14 years 1 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir