Concept

Randomness test

Related publications (67)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

What's all the noise about developmental stochasticity?

Andrew Charles Oates

In October 2010, researchers from diverse backgrounds collided at the historic Cumberland Lodge (Windsor, UK) to discuss the role of randomness in cell and developmental biology. Organized by James Briscoe and Alfonso Marinez-Arias, The Company of Biologis ...

2011

The effects of practice schedule and critical thinking prompts on learning and transfer of a complex judgment task.

Many instructional strategies that appear to improve learners' performance during training may not realize adequate posttest performance or transfer to a job. The converse has been found to be true as well: Instructional strategies that appear to slow the ...

2011

A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

Fabio Nobile

We investigate the convergence rate of approximations by finite sums of rank-1 tensors of solutions of multiparametric elliptic PDEs. Such PDEs arise, for example, in the parametric, deterministic reformulation of elliptic PDEs with random field inputs, ba ...

Society for Industrial and Applied Mathematics2010

Applications of Derandomization Theory in Coding

Mahdi Cheraghchi Bashi Astaneh

Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate ...

EPFL2010

Distributed Agreement with Optimal Communication Complexity

Seth Gilbert

We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication efficiency, using only O(n) bits of communication, and terminates in (almost optima ...

Siam, 3600 Univ City Science Center, Philadelphia, Pa 19104-2688 Usa2010

Multichannel Sequence Analysis Applied To Social Science Data

Philipp Bucher

Applications of optimal matching analysis in the social sciences are typically based on sequences of specific social statuses that model the residential, family, or occupational trajectories of individuals. Despite the broadly recognized interdependence of ...

2010

On Tracking Freeriders in Gossip Protocols

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Maxime Monod

Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received much attention as they help make such systems more robust against freeriding. ...

2009

Towards electron spin resonance of mechanically exfoliated graphene

László Forró, Arnaud Magrez, Andrzej Sienkiewicz, Luka Ciric, Bálint Náfrádi, Marijana Mionic Ebersold

We have attempted to prepare graphene samples by mechanical exfoliation of HOPG (highly oriented pyrolytic graphite) using scotch tape. Random testing of the flakes by AFM has shown in majority single layer graphene. Nevertheless, the presence of ultrathin ...

2009

Pseudo Random Numbers Generators available as Web Services

Sébastien Rumley

Series of Pseudo Random Numbers are often used as simulation input, and they strongly Influence the results. Thus, their usage and the usage of their generator need to be taken care of very well. Qualified generators are available on the web as source code ...

Soc Computer Simulation Int, Po Box 17900, San Diego, Ca 92177 Usa2008

The arcsine law as a universal aging scheme for trap models

Jiri Cerny

We give a general proof of aging for trap models using the arcsine law for stable subordinators. This proof is based on abstract conditions on the potential theory of the underlying graph and on the randomness of the trapping landscape. We apply this proof ...

2008