Sciweavers

7522 search results - page 1156 / 1505
» Spacing memetic algorithms
Sort
View
BMCBI
2005
112views more  BMCBI 2005»
15 years 4 months ago
Visualization methods for statistical analysis of microarray clusters
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
Matthew A. Hibbs, Nathaniel C. Dirksen, Kai Li, Ol...
CGF
2005
111views more  CGF 2005»
15 years 4 months ago
Hierarchyless Simplification, Stripification and Compression of Triangulated Two Manifolds
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...
Pablo Diaz-Gutierrez, Meenakshisundaram Gopi, Rena...
AI
2002
Springer
15 years 4 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
GPEM
2002
95views more  GPEM 2002»
15 years 3 months ago
On Appropriate Adaptation Levels for the Learning of Gene Linkage
A number of algorithms have been proposed aimed at tackling the problem of learning "Gene Linkage" within the context of genetic optimisation, that is to say, the problem...
James Smith
IPPS
2010
IEEE
15 years 2 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
« Prev « First page 1156 / 1505 Last » Next »