Sciweavers

1529 search results - page 63 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
CSB
2004
IEEE
152views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Comparative Analysis of Gene Sets in the Gene Ontology Space under the Multiple Hypothesis Testing Framework
The Gene Ontology (GO) resource can be used as a powerful tool to uncover the properties shared among, and specific to, a list of genes produced by high-throughput functional geno...
Sheng Zhong, Lu Tian, Cheng Li, Kai-Florian Storch...
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
IRREGULAR
1997
Springer
13 years 12 months ago
Parallel Shared-Memory State-Space Exploration in Stochastic Modeling
Stochastic modeling forms the basis for analysis in many areas, including biological and economic systems, as well as the performance and reliability modeling of computers and comm...
Susann C. Allmaier, Graham Horton
CEC
2010
IEEE
13 years 8 months ago
An analysis of the operation of differential evolution at high and low crossover rates
Abstract—A key parameter affecting the operation of differential evolution (DE) is the crossover rate Cr ∈ [0, 1]. While very low values are recommended for and used with separ...
James Montgomery, Stephen Chen