Sciweavers

644 search results - page 62 / 129
» Graph structured program evolution
Sort
View
RSA
2008
123views more  RSA 2008»
14 years 11 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 6 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
15 years 3 months ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum
HICSS
2010
IEEE
185views Biometrics» more  HICSS 2010»
15 years 6 months ago
Concurrent Architecture for Automated Malware Classification
This paper introduces a new architecture for automating the generalization of program structure and the recognition of common patterns in the area of malware analysis. By using ma...
Timothy Daly, Luanne Burns
ECOOP
2005
Springer
15 years 5 months ago
Towards a Meta-Modelling Approach to Configurable Middleware
Abstract. In our research we are studying how to combine modelling, metamodelling, and reflection to systematically generate middleware configurations that can be targeted at diffe...
Nelly Bencomo, Gordon S. Blair, Geoff Coulson, Tha...