Sciweavers

74 search results - page 2 / 15
» Generating New Beliefs from Old
Sort
View
CP
2006
Springer
13 years 9 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
NMR
2004
Springer
13 years 11 months ago
Generation and evaluation of different types of arguments in negotiation
Until now, AI argumentation-based systems have been mainly developed for handling inconsistency. In that explanation-oriented perspective, only one type of argument has been consi...
Leila Amgoud, Henri Prade
CP
2000
Springer
13 years 9 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
CVPR
2008
IEEE
14 years 7 months ago
(BP)2: Beyond pairwise Belief Propagation labeling by approximating Kikuchi free energies
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
Ifeoma Nwogu, Jason J. Corso
AAAI
2010
13 years 7 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos