Sciweavers

980 search results - page 127 / 196
» Evolutionary organizational search
Sort
View
GECCO
2004
Springer
15 years 5 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
ISSS
1998
IEEE
129views Hardware» more  ISSS 1998»
15 years 4 months ago
Application-Specific Heterogeneous Multiprocessor Synthesis Using Differential-Evolution
This paper presents an application-specific, heterogeneous multiprocessor synthesis system, named HeMPS, that combines a form of Evolutionary Computation known as Differential Evo...
Allan Rae, Sri Parameswaran
EVOW
2006
Springer
15 years 3 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
ICES
2000
Springer
91views Hardware» more  ICES 2000»
15 years 3 months ago
Dynamic Optimisation of Non-linear Feed Forward Circuits
Abstract. An evolutionary algorithm is used to evolve a digital circuit which computes a simple hash function mapping a 16-bit address space into an 8-bit one. The target technolog...
Ernesto Damiani, Valentino Liberali, Andrea Tettam...
AISB
1995
Springer
15 years 3 months ago
Specialised Recombinative Operators for Timetabling Problems
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
Edmund K. Burke, Dave Elliman, Rupert F. Weare