Sciweavers

288 search results - page 53 / 58
» Linearly bounded infinite graphs
Sort
View
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
MICAI
2005
Springer
14 years 29 days ago
Directed Cycles in Bayesian Belief Networks: Probabilistic Semantics and Consistency Checking Complexity
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
Alexander L. Tulupyev, Sergey I. Nikolenko
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
13 years 11 months ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
13 years 8 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
ML
2008
ACM
13 years 7 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer