Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Communications of the ACM
Parallel distributed genetic programming
New ideas in optimization
On the influence of the representation granularity in heuristic forma recombination
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Dependence graphs and compiler optimizations
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
DAG-Map: Graph-Based FPGA Technology Mapping for Delay Optimization
IEEE Design & Test
Improved directed acyclic graph evaluation and the combine operator in genetic programming
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Learning Bayesian network structures by searching for the best ordering with genetic algorithms
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Towards a More Efficient Evolutionary Induction of Bayesian Networks
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Implementation aspects of a delegation system
Proceedings of the 3rd international conference on Mobile multimedia communications
Representation and recombination over nonsingular binary matrices
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
| Hi-index | 0.00 |
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation is not separable, and the structure of the basic information units that must be processed in order to maintain feasibility of the solutions is described. As an experimental analysis indicates, a recombination operator using these units has sub-quadratic complexity in the graph size. It is also shown that a standard gene-transmission recombination operator is biased to produce solutions of lower edge-density than the parents' average. An unbiased allelic recombination operator provides better results on an ad-hoc test problem.