Sciweavers

1717 search results - page 90 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
AIPS
2006
15 years 7 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
WSC
2000
15 years 7 months ago
Simulation output analysis via dynamic batch means
This paper is focused on estimating the quality of the sample mean from a steady-state simulation experiment with consideration of computational efficiency, memory requirement, an...
Yingchieh Yeh, Bruce W. Schmeiser
CEC
2010
IEEE
15 years 7 months ago
An analysis of clustering objectives for feature selection applied to encrypted traffic identification
This work explores the use of clustering objectives in a Multi-Objective Genetic Algorithm (MOGA) for both, feature selection and cluster count optimization, under the application...
Carlos Bacquet, A. Nur Zincir-Heywood, Malcolm I. ...
BMCBI
2005
118views more  BMCBI 2005»
15 years 6 months ago
Feature selection and classification for microarray data analysis: Evolutionary methods for identifying predictive genes
Background: In the clinical context, samples assayed by microarray are often classified by cell line or tumour type and it is of interest to discover a set of genes that can be us...
Thanyaluk Jirapech-Umpai, J. Stuart Aitken
ICA
2004
Springer
15 years 11 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari