Sciweavers

5387 search results - page 371 / 1078
» Generating generic functions
Sort
View
STACS
2007
Springer
16 years 26 days ago
Pure Stationary Optimal Strategies in Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. Performances of an MDP are evaluated by a payoff function. The controller of ...
Hugo Gimbert
TPHOL
2003
IEEE
16 years 8 hour ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
15 years 8 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco
ICML
2010
IEEE
15 years 7 months ago
Bayesian Multi-Task Reinforcement Learning
We consider the problem of multi-task reinforcement learning where the learner is provided with a set of tasks, for which only a small number of samples can be generated for any g...
Alessandro Lazaric, Mohammad Ghavamzadeh
AEI
1998
98views more  AEI 1998»
15 years 6 months ago
Function-directed electrical design analysis
Functional labels provide a simple but very reusable way for defining the functionality of a system and for making use of that knowledge. Unlike more complex functional representa...
Chris J. Price