Sciweavers

2244 search results - page 121 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
TKDE
2008
118views more  TKDE 2008»
15 years 6 months ago
A Lagrangian Approach for Multiple Personalized Campaigns
The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. ...
Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon
GECCO
2010
Springer
189views Optimization» more  GECCO 2010»
15 years 3 months ago
Multiobjective evolutionary algorithm for software project portfolio optimization
Large software companies have to plan their project portfolio to maximize potential portfolio return and strategic alignment, while balancing various preferences, and considering ...
Thomas Kremmel, Jirí Kubalík, Stefan...
SCALESPACE
2009
Springer
16 years 26 days ago
A Scale-Space Approach to Landmark Constrained Image Registration
Adding external knowledge improves the results for ill-posed problems. In this paper we present a new multi-level optimization framework for image registration when adding landmark...
Eldad Haber, Stefan Heldmann, Jan Modersitzki
CC
2003
Springer
126views System Software» more  CC 2003»
15 years 11 months ago
Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
Abstract. Offset assignment is a highly effective DSP address code optimization technique that has been implemented in a number of ANSI C compilers. In this paper we concentrate on...
Rainer Leupers
DAC
2005
ACM
15 years 8 months ago
Circuit optimization using statistical static timing analysis
In this paper, we propose a new sensitivity based, statistical gate sizing method. Since circuit optimization effects the entire shape of the circuit delay distribution, it is dif...
Aseem Agarwal, Kaviraj Chopra, David Blaauw, Vladi...