Back to Results
First PageMeta Content
Random variable / Event / Independence / Variance / Markov chain / Probability distribution / Parameter / Mode / Probability space / Probability theory / Statistics / Probability and statistics


Approximate Inference for Infinite Contingent Bayesian Networks Brian Milch, Bhaskara Marthi, David Sontag, Stuart Russell, Daniel L. Ong and Andrey Kolobov Computer Science Division University of California Berkeley, C
Add to Reading List

Document Date: 2004-11-29 03:40:07


Open Document

File Size: 184,18 KB

Share Result on Facebook

City

Betaville / Belmont / Cambridge / Alphatown / Alphatown and Betaville / /

Company

MIT Press / Intel / Microsoft / /

/

Event

Natural Disaster / /

Facility

Stanford University / Andrey Kolobov Computer Science Division University of California Berkeley / /

IndustryTerm

likelihood weighting algorithm / natural solution / inference algorithm / similarity networks / inference algorithms / approximate inference algorithm / /

Organization

University of California / World Congress / MIT / UC Berkeley / Stanford University / PA DA / U.S. Securities and Exchange Commission / Andrey Kolobov Computer Science Division University / /

Person

Bob / Daniel L. Ong / Stuart Russell / Andrey Kolobov / Alice / David Sontag / Brian Milch / Morgan Kaufmann / /

/

Position

graphical model for this example / General / /

ProvinceOrState

Texas / California / Georgia / Massachusetts / /

RadioStation

CBN / /

SportsLeague

Stanford University / /

Technology

sampling algorithm / approximate inference algorithm / artificial intelligence / Java / inference algorithm / likelihood weighting algorithm / dom / intelligent agent / BN inference algorithms / /

SocialTag