5592 search results - page 244 / 1119 » On Random Betweenness Constraints |
190
click to vote
EOR
2002
15 years 6 months ago
2002
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
156
click to vote
CIE
2010
Springer
15 years 10 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
104
click to vote
CSB
2005
IEEE
16 years 3 days ago
2005
IEEE
Whole genome duplication (WGD) is followed by massive duplicate deletion that reorganizes gene adjacencies. We compare the deletion patterns and adjacency reorganization following...
120
click to vote
CPC
2010
15 years 6 months ago
2010
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
150
click to vote
BIOINFORMATICS
2006
15 years 6 months ago
2006
Summary: We present a new R package for the assessment of the reliability of clusters discovered in high dimensional DNA microarray data. The package implements methods based on r...