Sciweavers

978 search results - page 63 / 196
» Knowledge, Probability, and Adversaries
Sort
View
PODS
2006
ACM
156views Database» more  PODS 2006»
15 years 10 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
AIPS
2006
14 years 11 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
ICC
2009
IEEE
124views Communications» more  ICC 2009»
14 years 7 months ago
Optimal Weighted Antenna Selection for Imperfect Channel Knowledge from Training
Receive antenna selection (AS) reduces the hardware complexity of multi-antenna receivers by dynamically connecting an instantaneously best antenna element to the available radio ...
Vinod Kristem, Neelesh B. Mehta, Andreas F. Molisc...
ICML
2004
IEEE
15 years 10 months ago
Learning random walk models for inducing word dependency distributions
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
Kristina Toutanova, Christopher D. Manning, Andrew...
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
14 years 11 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...