251 search results - page 43 / 51 » Automated Complexity Analysis Based on the Dependency Pair M... |
123
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Microarray technology allows the simultaneous analysis of thousands of genes within a single experiment. Significance analyses of transcriptomic data ignore the gene d...
122
click to vote
DAC
2004
ACM
15 years 5 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
108
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: The epidermal physiology results from a complex regulated homeostasis of keratinocyte proliferation, differentiation and death and is tightly regulated by a specific p...
247
click to vote
SPIN
2012
Springer
13 years 3 months ago
2012
Springer
Since counterexamples generated by model checking tools are only symptoms of faults in the model, a significant amount of manual work is required in order to locate the fault that...
118
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...