Sciweavers

1300 search results - page 53 / 260
» Probabilistic logic with independence
Sort
View
ICLP
2009
Springer
14 years 9 months ago
A Language for Large Ensembles of Independently Executing Nodes
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
Michael P. Ashley-Rollman, Peter Lee, Seth Copen G...
FM
2006
Springer
127views Formal Methods» more  FM 2006»
14 years 10 days ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
UAI
2004
13 years 10 months ago
Convolutional Factor Graphs as Probabilistic Models
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
Yongyi Mao, Frank R. Kschischang, Brendan J. Frey
DLOG
2010
13 years 6 months ago
Structure Preserving TBox Repair using Defaults
Unsatisfiable concepts are a major cause for inconsistencies in Description Logics knowledge bases. Popular methods for repairing such concepts aim to remove or rewrite axioms to r...
Thomas Scharrenbach, Rolf Grütter, Bettina Wa...
CVPR
2011
IEEE
13 years 5 months ago
Multi-agent event recognition in structured scenarios
We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activit...
Vlad Morariu, Larry Davis