Top-down synthesis of divide-and-conquer algorithms

Artificial Intelligence 27 (1):43-96 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Evaluating evolutionary algorithms.W. Whitney, S. Rana, J. Dzubera & K. E. Mathias - 1996 - Artificial Intelligence 84 (1-2):357-358.
The distributed breakout algorithms.Katsutoshi Hirayama & Makoto Yokoo - 2005 - Artificial Intelligence 161 (1-2):89-115.
Isomorphisms of genetic algorithms.David L. Battle & Michael D. Vose - 1993 - Artificial Intelligence 60 (1):155-165.

Analytics

Added to PP
2020-12-22

Downloads
2 (#1,450,151)

6 months
1 (#1,912,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Non-resolution theorem proving.W. W. Bledsoe - 1977 - Artificial Intelligence 9 (1):1-35.
On program synthesis knowledge.Cordell Green & David Barstow - 1978 - Artificial Intelligence 10 (3):241-279.
Syntax-directed, semantics-supported program synthesis.Wolfgang Bibel - 1980 - Artificial Intelligence 14 (3):243-261.

Add more references