Efficient exhaustive generation of functional programs using monte-carlo search with iterative deepening

In Tu-Bao Ho & Zhi-Hua Zhou (eds.), Pricai 2008: Trends in Artificial Intelligence. Springer. pp. 199--210 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

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

Why Monte Carlo Simulations Are Inferences and Not Experiments.Claus Beisbart & John D. Norton - 2012 - International Studies in the Philosophy of Science 26 (4):403-422.
Mechanizing the Search for Explanatory Hypotheses.Bruce G. Buchanan - 1982 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1982:129 - 146.
Review of M. Giaquinto, The Search for Certainty. [REVIEW]Carlo Cellucci - 2003 - European Journal of Philosophy 11 (3):420-423.
Broadening the Iterative Conception of Set.Mark F. Sharlow - 2001 - Notre Dame Journal of Formal Logic 42 (3):149-170.
Theory of Computation.George J. Tourlakis - 2012 - Hoboken, N.J.: Wiley.
The iterative conception of set.Thomas Forster - 2008 - Review of Symbolic Logic 1 (1):97-110.
Monte Carlo estimation of chance performance for the radial arm maze.David A. Eckerman - 1980 - Bulletin of the Psychonomic Society 15 (2):93-95.
Data driven Markov Chain Monte Carlo algorithm.Alan Yuille & Daniel Kersten - 2006 - Trends in Cognitive Sciences 10 (7):301-308.

Analytics

Added to PP
2014-01-30

Downloads
18 (#819,350)

6 months
1 (#1,498,742)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Contraction-free sequent calculi for intuitionistic logic.Roy Dyckhoff - 1992 - Journal of Symbolic Logic 57 (3):795-807.

Add more references