Sciweavers

9842 search results - page 1379 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
IPPS
2008
IEEE
16 years 1 months ago
A study of master-slave approaches to parallelize NSGA-II
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
Juan José Durillo, Antonio J. Nebro, Franci...
CEC
2007
IEEE
16 years 1 months ago
A study on the design issues of Memetic Algorithm
— Over the recent years, there has been increasing research activities made on improving the efficacy of Memetic Algorithm (MA) for solving complex optimization problems. Partic...
Q. H. Nguyen, Yew-Soon Ong, Natalio Krasnogor
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
16 years 1 months ago
Two-level microprocessor-accelerator partitioning
The integration of microprocessors and field-programmable gate array (FPGA) fabric on a single chip increases both the utility and necessity of tools that automatically move softw...
Scott Sirowy, Yonghui Wu, Stefano Lonardi, Frank V...
IEEEPACT
2007
IEEE
16 years 1 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
IMSCCS
2007
IEEE
16 years 1 months ago
Ensemble Subsurface Modeling Using Grid Computing Technology
Ensemble Kalman Filter (EnKF) uses a randomized ensemble of subsurface models for error and uncertainty estimation. However, the complexity of geological models and the requiremen...
Xin Li, Zhou Lei, Christopher D. White, Gabrielle ...
« Prev « First page 1379 / 1969 Last » Next »