Sciweavers

8196 search results - page 35 / 1640
» Computational Modeling and Complexity Science
Sort
View
SPIN
2001
Springer
15 years 2 months ago
Distributed LTL Model-Checking in SPIN
Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in di...
Jiri Barnat, Lubos Brim, Jitka Stríbrn&aacu...
75
Voted
DIS
2007
Springer
15 years 3 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
72
Voted
NIPS
2000
14 years 11 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...
68
Voted
CCA
2009
Springer
15 years 4 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
COMPLEX
2009
Springer
15 years 4 months ago
Epidemic Self-synchronization in Complex Networks
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
Ingo Scholtes, Jean Botev, Markus Esch, Peter Stur...