Sciweavers

5247 search results - page 539 / 1050
» Frequency Optimized Computation Methods
Sort
View
EOR
2006
130views more  EOR 2006»
15 years 4 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
EOR
2006
73views more  EOR 2006»
15 years 4 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
15 years 3 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
192
Voted
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
14 years 8 months ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
SIAMSC
2008
198views more  SIAMSC 2008»
15 years 4 months ago
Model Reduction for Large-Scale Systems with High-Dimensional Parametric Input Space
A model-constrained adaptive sampling methodology is proposed for reduction of large-scale systems with high-dimensional parametric input spaces. Our model reduction method uses a ...
T. Bui-Thanh, Karen Willcox, Omar Ghattas