Sciweavers

378 search results - page 12 / 76
» Complete Interval Arithmetic and Its Implementation on the C...
Sort
View
RTA
1995
Springer
15 years 1 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
156
Voted
ICLP
2009
Springer
15 years 10 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...
COMPUTING
2006
130views more  COMPUTING 2006»
14 years 9 months ago
Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
Ulrike Baur, Peter Benner
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
15 years 6 months ago
Fast, Accurate Static Analysis for Fixed-Point Finite-Precision Effects in DSP Designs
Translating digital signal processing (DSP) software into its finite-precision hardware implementation is often a timeconsuming task. We describe a new static analysis technique ...
Claire Fang Fang, Rob A. Rutenbar, Tsuhan Chen
CORR
2008
Springer
105views Education» more  CORR 2008»
14 years 9 months ago
Certifying floating-point implementations using Gappa
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...
Florent de Dinechin, Christoph Quirin Lauter, Guil...