Sciweavers

364 search results - page 8 / 73
» A benchmark for the sorting network problem
Sort
View
ISMIR
2001
Springer
100views Music» more  ISMIR 2001»
15 years 8 months ago
Efficient Multidimensional Searching Routines
The problem of Music Information Retrieval can often be formalized as “searching for multidimensional trajectories”. It is well known that string-matching techniques provide r...
Josh Reiss
90
Voted
KES
2007
Springer
15 years 9 months ago
Design of Neural Networks
The paper offers a critical analysis of the procedure observed in many applications of neural networks. Given a problem to be solved, a favorite NN-architecture is chosen and its p...
Claudio Moraga
104
Voted
IWANN
2005
Springer
15 years 9 months ago
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
Carlos Cotta
115
Voted
CPAIOR
2005
Springer
15 years 9 months ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
TNN
2010
171views Management» more  TNN 2010»
14 years 10 months ago
Sensitivity versus accuracy in multiclass problems using memetic Pareto evolutionary neural networks
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high...
Juan Carlos Fernández Caballero, Francisco ...