Sciweavers

978 search results - page 160 / 196
» Knowledge, Probability, and Adversaries
Sort
View
IPM
2000
142views more  IPM 2000»
13 years 10 months ago
Adapting a diagnostic problem-solving model to information retrieval
In this paper, a competition-based connectionist model for diagnostic problem-solving is adapted to information retrieval. In this model, we treat documents as \disorders" an...
Inien Syu, Sheau-Dong Lang
TPDS
2002
80views more  TPDS 2002»
13 years 10 months ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
PE
2007
Springer
112views Optimization» more  PE 2007»
13 years 10 months ago
Multicast inference of temporal loss characteristics
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...
Vijay Arya, Nick G. Duffield, Darryl Veitch
FUIN
2010
94views more  FUIN 2010»
13 years 9 months ago
A Framework for Iterated Belief Revision Using Possibilistic Counterparts to Jeffrey's Rule
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to probabilistic inputs, is appropr...
Salem Benferhat, Didier Dubois, Henri Prade, Mary-...
IJAR
2010
130views more  IJAR 2010»
13 years 9 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki