Sciweavers

117 search results - page 7 / 24
» On the behavioral diversity of random programs
Sort
View
CP
2004
Springer
14 years 1 months ago
Statistical Regimes Across Constrainedness Regions
Abstract. Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of ...
Carla P. Gomes, Cèsar Fernández, Bar...
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 12 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
ISCA
2010
IEEE
284views Hardware» more  ISCA 2010»
14 years 1 months ago
Security refresh: prevent malicious wear-out and increase durability for phase-change memory with dynamically randomized address
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
Nak Hee Seong, Dong Hyuk Woo, Hsien-Hsin S. Lee
SRDS
2008
IEEE
14 years 2 months ago
Towards Reliable Reputations for Dynamic Networked Systems
A new generation of distributed systems and applications rely on the cooperation of diverse user populations motivated by self-interest. While they can utilize “reputation syste...
Gayatri Swamynathan, Ben Y. Zhao, Kevin C. Almerot...
CPAIOR
2008
Springer
13 years 10 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle