Sciweavers

6 search results - page 1 / 2
» Simple permutations mix even better
Sort
View
RSA
2008
89views more  RSA 2008»
13 years 9 months ago
Simple permutations mix even better
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
Alex Brodsky, Shlomo Hoory
BMCBI
2006
116views more  BMCBI 2006»
13 years 10 months ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...
CEC
2008
IEEE
14 years 4 days ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
CORR
2007
Springer
189views Education» more  CORR 2007»
13 years 10 months ago
Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks
Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity s...
Shuangqing Wei
SIGMETRICS
1999
ACM
14 years 2 months ago
NFS Sensitivity to High Performance Networks
This paper examines NFS sensitivity to performance characteristics of emerging networks. We adopt an unusual method of inserting controlled delays into live systems to measure sen...
Richard P. Martin, David E. Culler