Sciweavers

4377 search results - page 309 / 876
» Mass problems and randomness
Sort
View
ICNP
2005
IEEE
16 years 10 days ago
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
SC
2005
ACM
16 years 9 days ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
164
Voted
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
16 years 8 days ago
A study of evolutionary robustness in stochastically tiled polyominos
Given an evolutionary optimization problem with many possible genotypes for each phenotype this study investigates if the evolved genes for a given phenotype are more robust to po...
Justin Schonfeld, Daniel A. Ashlock
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
16 years 4 days ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
CEC
2003
IEEE
16 years 1 days ago
Learning DFA: evolution versus evidence driven state merging
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Simon M. Lucas, T. Jeff Reynolds