Sciweavers

1806 search results - page 29 / 362
» Randomness and halting probabilities
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Optimized expected information gain for nonlinear dynamical systems
This paper addresses the problem of active model selection for nonlinear dynamical systems. We propose a novel learning approach that selects the most informative subset of time-d...
Alberto Giovanni Busetto, Cheng Soon Ong, Joachim ...
DLT
2008
13 years 9 months ago
Universal Recursively Enumerable Sets of Strings
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
Cristian S. Calude, André Nies, Ludwig Stai...
AINA
2008
IEEE
14 years 2 months ago
PRODUCE: A Probability-Driven Unequal Clustering Mechanism for Wireless Sensor Networks
There has been proliferation of research on seeking for distributing the energy consumption among nodes in each cluster and between cluster heads to extend the network lifetime. H...
Jung-Hwan Kim, Sajjad Hussain Chauhdary, WenCheng ...
COMBINATORICS
2004
69views more  COMBINATORICS 2004»
13 years 7 months ago
Convergence in Distribution for Subset Counts Between Random Sets
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
Dudley Stark
RSA
2010
113views more  RSA 2010»
13 years 6 months ago
The order of the giant component of random hypergraphs
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang