Sciweavers

661 search results - page 2 / 133
» A Robust Approach for Improving Computational Efficiency of ...
Sort
View
EOR
2006
130views more  EOR 2006»
13 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
MP
2008
99views more  MP 2008»
13 years 4 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
SIAMJO
2002
122views more  SIAMJO 2002»
13 years 4 months ago
Robust Filtering via Semidefinite Programming with Applications to Target Tracking
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
Lingjie Li, Zhi-Quan Luo, Timothy N. Davidson, Kon...
INTEGRATION
2010
172views more  INTEGRATION 2010»
13 years 3 months ago
Analog circuits optimization based on evolutionary computation techniques
1 — This paper presents a new design automation tool based on a modified genetic algorithm kernel, in order to increase efficiency on the analog circuit and system design cycle. ...
Manuel F. M. Barros, Jorge Guilherme, Nuno Horta
HIS
2009
13 years 2 months ago
Improved Harmony Search for Economic Power Dispatch
This paper presents a novel optimization approach using Improved Harmony Search (IHS) algorithm to solve economic power dispatch problem. The proposed methodology easily takes care...
V. Ravikumar Pandi, Bijaya K. Panigrahi, Manas Kum...