5158 search results - page 319 / 1032 » Generalization of the Dempster-Shafer Theory |
168
click to vote
ECCC
2010
15 years 6 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
158
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
We address the problem of estimating discrete variables in a class of deterministic transition systems in which the continuous variables are available for measurement. We propose ...
150
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We examine a class of wagering mechanisms designed to elicit truthful predictions from a group of people without requiring any outside subsidy. We propose a number of desirable pr...
146
Voted
ACS
2005
15 years 6 months ago
2005
Applying (enriched) categorical structures we define the notion of ordered sheaf on a quantaloid Q, which we call `Q-order'. This requires a theory of semicategories enriched ...
150
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...