Sciweavers

1927 search results - page 154 / 386
» UMDAs for dynamic optimization problems
Sort
View
121
Voted
DATE
2006
IEEE
149views Hardware» more  DATE 2006»
15 years 9 months ago
Communication architecture optimization: making the shortest path shorter in regular networks-on-chip
Network-on-Chip (NoC)-based communication represents a promising solution to complex on-chip communication problems. Due to their regular structure, mesh-like NoC architectures ha...
Ümit Y. Ogras, Radu Marculescu, Hyung Gyu Lee...
138
Voted
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 8 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
84
Voted
GECCO
2003
Springer
15 years 8 months ago
Dynamic Maximum Tree Depth
We present a technique, designated as dynamic maximum tree depth, for avoiding excessive growth of tree-based GP individuals during the evolutionary process. This technique introdu...
Sara Silva, Jonas Almeida
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
15 years 10 months ago
Discrete dynamical genetic programming in XCS
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...
Richard Preen, Larry Bull
128
Voted
HOTOS
2003
IEEE
15 years 8 months ago
High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two
Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to ...
Charles Blake, Rodrigo Rodrigues