Sciweavers

382 search results - page 40 / 77
» Reasoning about the Elementary Functions of Complex Analysis
Sort
View
DSN
2008
IEEE
13 years 9 months ago
Experiences with formal specification of fault-tolerant file systems
Fault-tolerant, replicated file systems are a crucial component of today's data centers. Despite their huge complexity, these systems are typically specified only in brief pr...
Roxana Geambasu, Andrew Birrell, John MacCormick
UAI
2004
13 years 8 months ago
Dynamic Programming for Structured Continuous Markov Decision Problems
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
Zhengzhu Feng, Richard Dearden, Nicolas Meuleau, R...
CIE
2005
Springer
14 years 29 days ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui
BMCBI
2010
133views more  BMCBI 2010»
13 years 7 months ago
New components of the Dictyostelium PKA pathway revealed by Bayesian analysis of expression data
Background: Identifying candidate genes in genetic networks is important for understanding regulation and biological function. Large gene expression datasets contain relevant info...
Anup Parikh, Eryong Huang, Christopher Dinh, Blaz ...
FMOODS
2003
13 years 8 months ago
Design and Verification of Distributed Multi-media Systems
Performance analysis of computing systems, in particular distributed computing systems, is a complex process. Analysing the complex flows and interactions between a set of distribu...
David H. Akehurst, John Derrick, A. Gill Waters