273 search results - page 36 / 55 » Improving the Efficiency of Memory Partitioning by Address C... |
217
click to vote
GECCO
2011
Springer
14 years 3 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
118
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every use...
ISBRA
2007
Springer
15 years 6 months ago
2007
Springer
Clustering algorithms are employed in many bioinformatics tasks, including categorization of protein sequences and analysis of gene-expression data. Although these algorithms are r...
188
click to vote
EGPGV
2011
Springer
14 years 9 months ago
2011
Springer
With faster graphics hardware comes the possibility to realize even more complicated applications that require more detailed data and provide better presentation. The processors ke...
103
click to vote
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
We address the issue of providing highly informative and comprehensive annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a...