Sciweavers

1592 search results - page 166 / 319
» On the Equality of Probabilistic Terms
Sort
View
UAI
2004
15 years 7 months ago
A New Characterization of Probabilities in Bayesian Networks
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-...
Lenhart K. Schubert
AIPS
1996
15 years 7 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe
ATAL
2010
Springer
15 years 7 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
GECCO
2008
Springer
142views Optimization» more  GECCO 2008»
15 years 7 months ago
Complexity of Max-SAT using stochastic algorithms
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
Mohamed Qasem, Adam Prügel-Bennett
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
15 years 7 months ago
Discriminating self from non-self with finite mixtures of multivariate Bernoulli distributions
Affinity functions are the core components in negative selection to discriminate self from non-self. It has been shown that affinity functions such as the r-contiguous distance an...
Thomas Stibor