Sciweavers

2131 search results - page 29 / 427
» A computational approximation to the AIXI model
Sort
View
DAC
1998
ACM
14 years 8 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...
AMAI
2004
Springer
14 years 1 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
DISCO
1992
161views Hardware» more  DISCO 1992»
13 years 11 months ago
Combinatory Models and Symbolic Computation
We introduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of alge...
Karl Aberer
CMSB
2006
Springer
13 years 11 months ago
Stronger Computational Modelling of Signalling Pathways Using Both Continuous and Discrete-State Methods
Abstract. Starting from a biochemical signalling pathway model expressed in a process algebra enriched with quantitative information we automatically derive both continuous-space a...
Muffy Calder, Adam Duguid, Stephen Gilmore, Jane H...
ICDAR
2007
IEEE
14 years 1 months ago
Representing and Characterizing Handwritten Mathematical Symbols through Succinct Functional Approximation
We model on-line ink traces for a set of 219 symbols to “best fit” low-degree polynomial series. Using a collection of mathematical writing samples, we find that in many cas...
Bruce W. Char, Stephen M. Watt