75 search results - page 10 / 15 » Propositional belief merging and belief negotiation model |
CIKM
2001
Springer
13 years 12 months ago
2001
Springer
Data fusion on the Web refers to the merging, into a unified single list, of the ranked document lists, which are retrieved in response to a user query by more than one Web search...
JMLR
2012
11 years 10 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
NSPW
2004
ACM
14 years 27 days ago
2004
ACM
This paper considers a new security protocol paradigm whereby principals negotiate and on-the-fly generate security protocols according to their needs. When principals wish to in...
AAAI
2011
12 years 7 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
SAT
2005
Springer
14 years 28 days ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...