Sciweavers

174 search results - page 12 / 35
» Monotonicity in Calculational Proofs
Sort
View
AISC
2010
Springer
14 years 5 days ago
Formal Proof of SCHUR Conjugate Function
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
Franck Butelle, Florent Hivert, Micaela Mayero, Fr...
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 7 months ago
Bridge configurations in piezoresistive two-axis accelerometers
In piezoresisitive two-axis accelerometers with two proof masses suspended by cantilever beams, there are generally many ways to configure the Wheatstone bridges. The configuratio...
E. Halvorsen, S. Husa
TC
2011
13 years 2 months ago
Exact and Approximated Error of the FMA
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
Sylvie Boldo, Jean-Michel Muller
LFP
1992
78views more  LFP 1992»
13 years 8 months ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
Tyng-Ruey Chuang, Benjamin Goldberg
AUSAI
2003
Springer
14 years 18 days ago
A Defeasible Logic of Policy-Based Intention
Most of the theories on formalising intention interpret it as a unary modal operator in Kripkean semantics, which gives it a monotonic look. We argue that policy-based intentions [...
Guido Governatori, Vineet Padmanabhan