5158 search results - page 288 / 1032 » Generalization of the Dempster-Shafer Theory |
168
click to vote
AAAI
2007
15 years 9 months ago
2007
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
139
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
178
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
165
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
149
click to vote
AGI
2008
15 years 8 months ago
2008
Learning theory and programs to date are inductively bounded: they can be described as "wind-up toys" which can only learn the kinds of things that their designers envisi...