Sciweavers

213 search results - page 15 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
CEC
2008
IEEE
15 years 4 months ago
Dynamic adaptation and multiobjective concepts in a particle swarm optimizer for constrained optimization
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
Jorge Isacc Flores-Mendoza, Efrén Mezura-Mo...
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
15 years 1 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
75
Voted
NIPS
2008
14 years 11 months ago
Dynamic visual attention: searching for coding length increments
A visual attention system should respond placidly when common stimuli are presented, while at the same time keep alert to anomalous visual inputs. In this paper, a dynamic visual ...
Xiaodi Hou, Liqing Zhang
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
15 years 3 months ago
A hybrid evolutionary programming algorithm for spread spectrum radar polyphase codes design
This paper presents a hybrid evolutionary programming algorithm to solve the spread spectrum radar polyphase code design problem. The proposed algorithm uses an Evolutionary Progr...
Ángel M. Pérez-Bellido, Sancho Salce...
NPC
2010
Springer
14 years 8 months ago
Exposing Tunable Parameters in Multi-threaded Numerical Code
Achieving high performance on today’s architectures requires careful orchestration of many optimization parameters. In particular, the presence of shared-caches on multicore arch...
Apan Qasem, Jichi Guo, Faizur Rahman, Qing Yi