977 search results - page 3 / 196 » Secure Computation with Fixed-Point Numbers |
FCCM
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper presents a method that offers a uniform treatment for bit-width optimisation of both fixed-point and floating-point designs. Our work utilises automatic differentiation...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
FUIN
2010
13 years 6 months ago
2010
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...