Sciweavers

10988 search results - page 359 / 2198
» Algorithmic Folding Complexity
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
15 years 6 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
TNN
2010
234views Management» more  TNN 2010»
14 years 11 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
194
Voted
FOGA
1998
15 years 6 months ago
Understanding Interactions among Genetic Algorithm Parameters
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
Kalyanmoy Deb, Samir Agrawal
ICC
2007
IEEE
122views Communications» more  ICC 2007»
15 years 11 months ago
Code-Aided ML Ambiguity Resolution
Abstract— This paper deals with code-aided (CA) maximumlikelihood (ML) phase and timing ambiguity resolution. We propose a methodology based on the sum-product algorithm (SPA) to...
Cédric Herzet, Luc Vandendorpe
HIS
2008
15 years 6 months ago
Genetic-Based Synthetic Data Sets for the Analysis of Classifiers Behavior
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specif...
Núria Macià, Albert Orriols-Puig, Es...