Sciweavers

886 search results - page 21 / 178
» On the Autoreducibility of Random Sequences
Sort
View
153
Voted
ISTCS
1993
Springer
15 years 9 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek
CIE
2009
Springer
16 years 5 days ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
BMCBI
2007
114views more  BMCBI 2007»
15 years 5 months ago
False occurrences of functional motifs in protein sequences highlight evolutionary constraints
Background: False occurrences of functional motifs in protein sequences can be considered as random events due solely to the sequence composition of a proteome. Here we use a nume...
Allegra Via, Pier Federico Gherardini, Enrico Ferr...
150
Voted
SOFSEM
2009
Springer
15 years 10 months ago
Randomness and Determination, from Physics and Computing towards Biology
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
Giuseppe Longo
CEC
2008
IEEE
16 years 2 days ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...