Sciweavers

3653 search results - page 232 / 731
» On Recognizable Timed Languages
Sort
View
JMLR
2012
13 years 9 months ago
Bayesian regularization of non-homogeneous dynamic Bayesian networks by globally coupling interaction parameters
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
Marco Grzegorczyk, Dirk Husmeier
SIGSOFT
2008
ACM
16 years 8 months ago
Asynchronous exception propagation in blocked tasks
Asynchronous exception propagation is a useful alternative form of communication among threads, especially if timely propagation is ensured. However, timely propagation is impossi...
Roy Krischer, Peter A. Buhr
ICFP
2003
ACM
16 years 7 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah
TIME
2009
IEEE
16 years 1 months ago
Strong Temporal, Weak Spatial Logic for Rule Based Filters
—Rule-based filters are sequences of rules formed of a condition and a decision. Rules are applied sequentially up to the first fulfilled condition, whose matching decision de...
Roger Villemaire, Sylvain Hallé
TIME
2003
IEEE
16 years 15 days ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...