605 search results - page 88 / 121 » Comparison of Evolutionary Algorithms for Design Optimizatio... |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...
COR
2007
13 years 7 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
ICCD
2004
IEEE
14 years 4 months ago
2004
IEEE
The increasing clock frequencies in high-end industrial circuits bring new routing challenges that can not be handled by traditional algorithms. An important design automation pro...