Sciweavers

235 search results - page 2 / 47
» Compiling Bayesian Networks Using Variable Elimination
Sort
View
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
13 years 10 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
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...
Jelle R. Kok, Nikos A. Vlassis
LCTRTS
2009
Springer
13 years 11 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
FLAIRS
2009
13 years 2 months ago
Join Tree Propagation Utilizing Both Arc Reversal and Variable Elimination
In this paper, we put forth the first join tree propagation algorithm that selectively applies either arc reversal (AR) or variable elimination (VE) to build the propagated messag...
Cory J. Butz, Ken Konkel, Pawan Lingras
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
13 years 10 months ago
Structure Search and Stability Enhancement of Bayesian Networks
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
Hanchuan Peng, Chris H. Q. Ding
LOPSTR
2005
Springer
13 years 10 months ago
An Algorithm for Local Variable Elimination in Normal Logic Programs
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as ...
Javier Álvez, Paqui Lucio