2244 search results - page 291 / 449 » A new heuristic approach for non-convex optimization problem... |
215
click to vote
IEEEINTERACT
2002
IEEE
16 years 1 days ago
2002
IEEE
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
219
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
177
click to vote
GECCO
2003
Springer
16 years 9 days ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
174
click to vote
ICCD
2007
IEEE
16 years 4 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
187
click to vote
PLDI
1995
ACM
15 years 10 months ago
1995
ACM
Correctly predicting the direction that branches will take is increasingly important in today’s wide-issue computer architectures. The name program-based branch prediction is gi...