Automatic programming: A tutorial on formal methodologies
Journal of Symbolic Computation
Speeding up the Synthesis of Programs from Traces
IEEE Transactions on Computers
Mining Natural Language Programming Directives with Class-Oriented Bayesian Networks
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Hi-index | 0.00 |
Additive AND/OR graphs are defined as AND/ OR graphs without circuits, which can be considered as folded AND/OR trees; i. e. the cost of a common subproblem is added to the cost as many times as the subproblem occurs, but it is computed only once. Additive ...