15792 search results - page 48 / 3159 » Computational Abstraction Steps |
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
ICCSA
2007
Springer
14 years 3 months ago
2007
Springer
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
AO
2007
13 years 9 months ago
2007
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
TSP
2008
13 years 9 months ago
2008
Abstract--A method for the computation of nonlinear digital filter networks containing delay-free loops is proposed. By preserving the topology of the network this method permits t...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...