Sciweavers

1173 search results - page 24 / 235
» Program Derivation Using Analogy
Sort
View
ETAI
2000
84views more  ETAI 2000»
13 years 8 months ago
Learning Stochastic Logic Programs
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...
Stephen Muggleton
CEC
2009
IEEE
14 years 3 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney
ICIP
2003
IEEE
14 years 10 months ago
Sparse decompositions in "incoherent" dictionaries
The purpose of this paper is to generalize a result by Donoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We conside...
Morten Nielsen, Rémi Gribonval
JAIR
2008
135views more  JAIR 2008»
13 years 9 months ago
On Similarities between Inference in Game Theory and Machine Learning
In this paper, we elucidate the equivalence between inference in game theory and machine learning. Our aim in so doing is to establish an equivalent vocabulary between the two dom...
Iead Rezek, David S. Leslie, Steven Reece, Stephen...
IPPS
1998
IEEE
14 years 1 months ago
Building BSP Programs Using the Refinement Calculus
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed...
David B. Skillicorn