Sciweavers

5595 search results - page 10 / 1119
» Comparing Subsumption Optimizations
Sort
View
CEC
2007
IEEE
14 years 1 months ago
Comparing bio-inspired algorithms in constrained optimization problems
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
Efrén Mezura-Montes, Blanca Cecilia Lopez-R...
APPINF
2003
13 years 8 months ago
Comparing the Optimal Performance of Multiprocessor Architectures
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
Lars Lundberg, Kamilla Klonowska, Magnus Broberg, ...
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
13 years 11 months ago
A comparative study of differential evolution variants for global optimization
In this paper, we present an empirical comparison of some Differential Evolution variants to solve global optimization problems. The aim is to identify which one of them is more s...
Efrén Mezura-Montes, Jesús Vel&aacut...
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
13 years 7 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg
SIROCCO
2007
13 years 8 months ago
Optimal Conclusive Sets for Comparator Networks
A set of input vectors S is conclusive if correct functionality for all input vectors is implied by correct functionality over vectors in S. We consider four functionalities of co...
Guy Even, Tamir Levi, Ami Litman