Sciweavers

198 search results - page 4 / 40
» Using Genetic Programming for Turing Machine Induction
Sort
View
PRICAI
2004
Springer
15 years 2 months ago
Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation
Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the i...
Susumu Katayama
EMO
2006
Springer
120views Optimization» more  EMO 2006»
14 years 11 months ago
Rule Induction for Classification Using Multi-objective Genetic Programming
Multi-objective metaheuristics have previously been applied to partial classification, where the objective is to produce simple, easy to understand rules that describe subsets of a...
Alan P. Reynolds, Beatriz de la Iglesia
MST
2002
97views more  MST 2002»
14 years 9 months ago
Programmed Mutagenesis Is Universal
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...
Julia Khodor, David K. Gifford
SOFSEM
2012
Springer
13 years 5 months ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas
ICTAI
2007
IEEE
15 years 3 months ago
ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming
In this paper we developed an Inductive Logic Programming (ILP) based framework ExOpaque that is able to extract a set of Horn clauses from an arbitrary opaque machine learning mo...
Yunsong Guo, Bart Selman