Sciweavers

1449 search results - page 114 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
DSN
2007
IEEE
15 years 10 months ago
Automatic Verification and Discovery of Byzantine Consensus Protocols
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
Piotr Zielinski
ATAL
2004
Springer
15 years 10 months ago
Generating Coalition Structures with Finite Bound from the Optimal Guarantees
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent system...
Viet Dung Dang, Nicholas R. Jennings
AAAI
2008
15 years 8 months ago
Hybrid Markov Logic Networks
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...
Jue Wang, Pedro Domingos
FLAIRS
2008
15 years 8 months ago
Distributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Yang Xiang, Wanling Zhang
ICMLA
2007
15 years 7 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira