16430 search results - page 105 / 3286 » On Computable Tree Functions |
107
click to vote
RC
2007
15 years 2 months ago
2007
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
111
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
144
click to vote
IPL
2006
15 years 3 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
129
Voted
EUROPAR
2005
Springer
15 years 9 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
118
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Computed prediction represents a major shift in learning classifier system research. XCS with computed prediction, based on linear approximators, has been applied so far to functi...