Sciweavers

9842 search results - page 1882 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetic optimization for yacht design
This paper introduces a procedure for using genetic multiobjective optimization in yacht design. The problem described consists on the optimization of a bulb shape to improve the ...
Paolo Geremia, Mauro Poian, Silvia Poles
GECCO
2007
Springer
135views Optimization» more  GECCO 2007»
14 years 1 months ago
A cumulative evidential stopping criterion for multiobjective optimization evolutionary algorithms
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
Luis Martí, Jesús García, Ant...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
HIPC
2007
Springer
14 years 1 months ago
Self-optimization of Performance-per-Watt for Interleaved Memory Systems
- With the increased complexity of platforms coupled with data centers’ servers sprawl, power consumption is reaching unsustainable limits. Memory is an important target for plat...
Bithika Khargharia, Salim Hariri, Mazin S. Yousif
HIPEAC
2007
Springer
14 years 1 months ago
A Throughput-Driven Task Creation and Mapping for Network Processors
Abstract. Network processors are programmable devices that can process packets at a high speed. A network processor is typified by multithreading and heterogeneous multiprocessing...
Lixia Liu, Xiao-Feng Li, Michael K. Chen, Roy Dz-C...
« Prev « First page 1882 / 1969 Last » Next »