1529 search results - page 25 / 306 » Search Space Analysis of the Linear Ordering Problem |
125
click to vote
AAAI
1990
15 years 4 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
144
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
158
Voted
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
353
Voted
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
141
Voted
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Speaker independent feature extraction is a critical problem in speech recognition. Oriented principal component analysis (OPCA) is a potential solution that can find a subspace r...