Sciweavers

3845 search results - page 328 / 769
» Belief Logic Programming
Sort
View
ISN
1994
Springer
136views Communications» more  ISN 1994»
15 years 10 months ago
High-Level Access APIs in the OSIMIS TMN Platform: Harnessing and Hiding
There is a common unjustified belief that OSI management technology, despite being very powerful, is difficult to implement because of the complexity of the underlying service/prot...
George Pavlou, Thurain Tin, Andy Carr
NIPS
2008
15 years 8 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
ATAL
2010
Springer
15 years 7 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 6 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
PPDP
2005
Springer
16 years 3 days ago
Trace effects and object orientation
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
Christian Skalka