16430 search results - page 906 / 3286 » On Computable Tree Functions |
221
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We propose a method for constructing Dempster-Shafer belief functions modeling the trust of a given agent (the evaluator) in another (the target) by combining statistical informat...
218
click to vote
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
191
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
183
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...
215
click to vote
CVIU
2008
15 years 7 months ago
2008
This paper presents a new computational framework for modelling visual-object based attention and attention-driven eye movements within an integrated system in a biologically insp...