38 search results - page 6 / 8 » cca 2009 |
123
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
118
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
146
Voted
CCA
2009
Springer
15 years 10 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
362
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
160
click to vote
QOSA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Component interfaces, as advanced by the Common Component Architecture (CCA), enable easy access to complex software packages for high-performance scientific computing. ...