Sciweavers

5331 search results - page 1017 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
GECCO
2009
Springer
14 years 3 months ago
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
Philipp Rohlfshagen, Per Kristian Lehre, Xin Yao
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
14 years 3 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
MEMOCODE
2006
IEEE
14 years 2 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
INFOCOM
2005
IEEE
14 years 2 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 2 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
« Prev « First page 1017 / 1067 Last » Next »