Sciweavers

3142 search results - page 20 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
IJON
1998
82views more  IJON 1998»
14 years 9 months ago
Solving arithmetic problems using feed-forward neural networks
We design new feed-forward multi-layered neural networks which perform di erent elementary arithmetic operations, such as bit shifting, addition of N p-bit numbers, and multiplica...
Leonardo Franco, Sergio A. Cannas
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 3 months ago
COSMO: a correlation sensitive mutation operator for multi-objective optimization
This contribution is the first to discover exploitable structural features within circuit optimization problems (COP) and discuss how it is indicative of a general structure and ...
Varun Aggarwal, Una-May O'Reilly
101
Voted
EWSN
2009
Springer
15 years 10 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
CEC
2005
IEEE
15 years 3 months ago
A model-based evolutionary algorithm for bi-objective optimization
Abstract- The Pareto optimal solutions to a multiobjective optimization problem often distribute very regularly in both the decision space and the objective space. Most existing ev...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Edward P. K....