5158 search results - page 82 / 1032 » Generalization of the Dempster-Shafer Theory |
COMPSAC
2006
IEEE
14 years 3 months ago
2006
IEEE
Cybernetics, among its more general definitions, is about effective governance of dynamic probabilistic systems. First order cybernetics is concerned with [software] processes gov...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
TACS
1994
Springer
14 years 29 days ago
1994
Springer
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
FTCIT
2007
13 years 8 months ago
2007
This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition...