Sciweavers

64 search results - page 5 / 13
» Compiler-Directed I O Optimization
Sort
View
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
14 years 1 months ago
Analyzing the effects of module encapsulation on search space bias
Modularity is thought to improve the evolvability of biological systems [18, 22]. Recent studies in the field of evolutionary computation show that the use of modularity improves...
Ozlem O. Garibay, Annie S. Wu
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 7 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
14 years 10 days ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
TMI
2010
206views more  TMI 2010»
13 years 2 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í...
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
14 years 1 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles