Sciweavers

1144 search results - page 21 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
ISLPED
2010
ACM
183views Hardware» more  ISLPED 2010»
14 years 9 months ago
A pareto-algebraic framework for signal power optimization in global routing
This paper proposes a framework for (signal) interconnect power optimization at the global routing stage. In a typical design flow, the primary objective of global routing is mini...
Hamid Shojaei, Tai-Hsuan Wu, Azadeh Davoodi, Twan ...
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
14 years 4 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 3 months ago
Two-level of nondominated solutions approach to multiobjective particle swarm optimization
In multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergen...
M. A. Abido
CSCLP
2008
Springer
14 years 11 months ago
Robust Solutions in Unstable Optimization Problems
We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
TEC
2010
171views more  TEC 2010»
14 years 4 months ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li