FLAIRS
2009
13 years 2 months ago
2009
We compare two approaches to Bayesian network inference, called variable elimination (VE) and arc reversal (AR). It is established that VE never requires more space than AR, and n...
IJCAI
2007
13 years 6 months ago
2007
We investigate three parameterized algorithmic schemes for graphical models that can accommodate trade-offs between time and space: 1) AND/OR Adaptive Caching (AOC(i)); 2) Variabl...
EVOW
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
ROBOCUP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
ICML
2002
IEEE
14 years 5 months ago
2002
IEEE
