Sciweavers

101 search results - page 5 / 21
» Automating the approximate record-matching process
Sort
View
LICS
2012
IEEE
11 years 10 months ago
A Higher-Order Distributed Calculus with Name Creation
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
Adrien Piérard, Eijiro Sumii
JMLR
2010
157views more  JMLR 2010»
13 years 2 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
14 years 26 days ago
Using Genetic Programming to Obtain a Closed-Form Approximation to a Recursive Function
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
Evan Kirshenbaum, Henri Jacques Suermondt
ILP
2003
Springer
14 years 20 days ago
Graph Kernels and Gaussian Processes for Relational Reinforcement Learning
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
Thomas Gärtner, Kurt Driessens, Jan Ramon
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening