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-...
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...
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...
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 ...
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...