Sciweavers

2899 search results - page 77 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
SBCCI
2009
ACM
187views VLSI» more  SBCCI 2009»
15 years 6 months ago
Design of low complexity digital FIR filters
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
Levent Aksoy, Diego Jaccottet, Eduardo Costa
LICS
1997
IEEE
15 years 5 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
GECCO
2000
Springer
15 years 5 months ago
Modeling GA Performance for Control Parameter Optimization
Optimization of the control parameters of genetic algorithms is often a time consuming and tedious task. In this work we take the meta-level genetic algorithm approach to control ...
Vincent A. Cicirello, Stephen F. Smith
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 5 months ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
15 years 7 months ago
Parallel genetic algorithm: assessment of performance in multidimensional scaling
Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medica...
Antanas Zilinskas, Julius Zilinskas