Sciweavers

207 search results - page 26 / 42
» A New Selection Ratio for Large Population Sizes
Sort
View
GECCO
2008
Springer
257views Optimization» more  GECCO 2008»
13 years 9 months ago
Rapid evaluation and evolution of neural models using graphics card hardware
This paper compares three common evolutionary algorithms and our modified GA, a Distributed Adaptive Genetic Algorithm (DAGA). The optimal approach is sought to adapt, in near rea...
Thomas F. Clayton, Leena N. Patel, Gareth Leng, Al...
TABLETOP
2007
IEEE
14 years 2 months ago
Examination of Text-Entry Methods for Tabletop Displays
Although text entry is a vital part of day-to-day computing familiar to most people, not much research has been done to enable text entry on large interactive tables. One might as...
Uta Hinrichs, Mark S. Hancock, M. Sheelagh T. Carp...
TMI
2010
206views more  TMI 2010»
13 years 3 months ago
Random Subspace Ensembles for fMRI Classification
Classification of brain images obtained through functional magnetic resonance imaging (fMRI) poses a serious challenge to pattern recognition and machine learning due to the extrem...
Ludmila I. Kuncheva, Juan José Rodrí...
ESA
2008
Springer
95views Algorithms» more  ESA 2008»
13 years 10 months ago
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 3 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov