Sciweavers

644 search results - page 65 / 129
» Graph structured program evolution
Sort
View
CSCLP
2004
Springer
15 years 5 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 3 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
ICALP
2005
Springer
15 years 5 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
ETFA
2008
IEEE
15 years 6 months ago
Automatic generation of bond graph models of process plants
This paper presents an application for the automatic generation of Bond Graph models. The basis for this automated creation is a modified plant model in the XML-format according t...
Sebastian Beez, Alexander Fay, Nina F. Thornhill
JDA
2006
85views more  JDA 2006»
14 years 11 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger