Sciweavers

271 search results - page 12 / 55
» Graph limits and parameter testing
Sort
View
RECOMB
2010
Springer
14 years 4 months ago
Incremental Signaling Pathway Modeling by Data Integration
Constructing quantitative dynamic models of signaling pathways is an important task for computational systems biology. Pathway model construction is often an inherently incremental...
Geoffrey Koh, David Hsu, P. S. Thiagarajan
KBSE
2008
IEEE
14 years 4 months ago
Random Test Run Length and Effectiveness
Abstract—A poorly understood but important factor in random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear wheth...
James H. Andrews, Alex Groce, Melissa Weston, Ru-G...
ISSTA
1993
ACM
14 years 2 months ago
Faults on Its Sleeve: Amplifying Software Reliability Testing
Most of the effort that goes into improving the quality of software paradoxically does not lead to quantitative, measurable quality. Software developers and quality-assurance orga...
Richard G. Hamlet, Jeffrey M. Voas
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
14 years 4 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
PIMRC
2010
IEEE
13 years 7 months ago
Frame delay distribution analysis of IEEE 802.11 networks using Signal Flow Graphs
Frame delay variance in CSMA/CA networks is large. Wireless applications may require both, limited mean delay and limited delay jitter. These parameters can be derived easily from ...
Ralf Jennen, Sebastian Max, Bernhard Walke