Sciweavers

2266 search results - page 315 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 11 months ago
Marsh: min-area retiming with setup and hold constraints
This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock ...
Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K...
CEC
2005
IEEE
16 years 11 days ago
Dynamic niching in evolution strategies with covariance matrix adaptation
Abstract- Evolutionary Algorithms (EAs) have the tendency to converge quickly into a single solution in the search space. However, many complex search problems require the identiï¬...
Ofer M. Shir, Thomas Bäck
GECCO
2004
Springer
16 years 4 days ago
On Multi-class Classification by Way of Niching
In recent literature, the niche enabling effects of crowding and the sharing algorithms have been systematically investigated in the context of Genetic Algorithms and are now estab...
Andrew R. McIntyre, Malcolm I. Heywood
CEC
2007
IEEE
15 years 10 months ago
Development and validation of different hybridization strategies between GA and PSO
In this paper a new class of hybridization strategies between GA and PSO is presented and validated. The Genetical Swarm Optimization (GSO) approach is presented here with respect ...
A. Gandelli, F. Grimaccia, Marco Mussetta, Paola P...