Sciweavers

2354 search results - page 62 / 471
» Randomness, Stochasticity and Approximations
Sort
View
CSFW
2010
IEEE
13 years 11 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
14 years 1 months ago
A study of evolutionary robustness in stochastically tiled polyominos
Given an evolutionary optimization problem with many possible genotypes for each phenotype this study investigates if the evolved genes for a given phenotype are more robust to po...
Justin Schonfeld, Daniel A. Ashlock
COLOGNETWENTE
2010
13 years 6 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik
AMC
2006
145views more  AMC 2006»
13 years 7 months ago
Computing the moments of high dimensional solutions of the master equation
Derived from the Markov character only, the master equation of chemical reactions is an accurate stochastic description of quite general systems in chemistry. Exact solutions of t...
Stefan Engblom