Sciweavers

1096 search results - page 52 / 220
» Computation Slicing: Techniques and Theory
Sort
View
ICTAC
2009
Springer
14 years 2 months ago
The Secret Art of Computer Programming
“Classical” program development by refinement [12, 2, 3] is a technique for ensuring that source-level program code remains faithful to the semantic goals set out in its corre...
Annabelle McIver
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
14 years 25 days ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
UAI
2001
13 years 9 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
TPHOL
1995
IEEE
13 years 11 months ago
HOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...
Franz Regensburger
AMC
2006
145views more  AMC 2006»
13 years 8 months ago
Computing the moments of high dimensional solutions of the master equation
Derived from the Markov character only, the master equation of chemical reactions is an accurate stochastic description of quite general systems in chemistry. Exact solutions of t...
Stefan Engblom