Sciweavers

922 search results - page 60 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
14 years 3 months ago
Pricing the 'free lunch' of meta-evolution
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
Alexei V. Samsonovich, Kenneth A. De Jong
MFCS
2005
Springer
14 years 3 months ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari
ASIACRYPT
2011
Springer
12 years 10 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
POPL
2007
ACM
14 years 10 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 4 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen