999 search results - page 32 / 200 » On the Decidability of Functional Uncertainty |
AMAI
2008
Springer
13 years 8 months ago
2008
Springer
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their ...
FLOPS
2010
Springer
13 years 7 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...
ISCAS
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper we propose a method for lowering the power consumption in our previously proposed method for approximating elementary functions. By rearranging the interconnect o...