5158 search results - page 142 / 1032 » Generalization of the Dempster-Shafer Theory |
CIE
2007
Springer
14 years 4 months ago
2007
Springer
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
FCT
2007
Springer
14 years 4 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
SIGDOC
2006
ACM
14 years 4 months ago
2006
ACM
This work will present elements of Genrich Altshuller’s Theory of Inventive Problem Solving, also known as TRIZ, and use them to describe the structural patterns found in the Ga...
SIGIR
2006
ACM
14 years 4 months ago
2006
ACM
This poster investigates the use of theoretical benchmarks to describe the matching functions of XML retrieval systems and the properties of specificity and exhaustivity in XML r...
CADE
2008
Springer
14 years 4 days ago
2008
Springer
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....