5158 search results - page 58 / 1032 » Generalization of the Dempster-Shafer Theory |
EOR
2010
13 years 9 months ago
2010
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
BIRTHDAY
2000
Springer
14 years 1 months ago
2000
Springer
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...