5804 search results - page 299 / 1161 » Doing more with less |
195
click to vote
IJCAI
2003
15 years 8 months ago
2003
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
187
Voted
FLAIRS
2000
15 years 8 months ago
2000
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. As a consequence of their coarse level of representation detail, qualitativ...
163
click to vote
WEBNET
1998
15 years 8 months ago
1998
: A multi-level hypermap interface was created for the display of world wide web pages relevant to an undergraduate class in Sensation and Perception. Assessment of the interface c...
196
click to vote
UAI
2000
15 years 8 months ago
2000
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. Due to their coarse level of representation detail, qualitative probabilist...
184
click to vote
IJCAI
1993
15 years 8 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...