6300 search results - page 1218 / 1260 » We have it easy, but do we have it right |
122
Voted
NIPS
2007
15 years 2 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
111
click to vote
AIPS
2006
15 years 2 months ago
2006
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 ...
98
Voted
EHCI
2004
15 years 2 months ago
2004
This paper addresses software adaptation to context of use. It goes one step further than our early work on plasticity [5]. Here, we propose a revision of the notion of software pl...
97
Voted
AIPS
2003
15 years 2 months ago
2003
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
109
Voted
NIPS
2004
15 years 2 months ago
2004
Theories of access consciousness address how it is that some mental states but not others are available for evaluation, choice behavior, and verbal report. Farah, O'Reilly, a...