357 search results - page 38 / 72 » Computing Reachable States for Nonlinear Biological Models |
161
Voted
CONCUR
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
107
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
— The purpose of this article is to provide potential neuroscientists and computer scientists with an artificial retina model, delivering spikes to higher-level visual tasks sim...
113
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic...
139
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: Recent technological advances in mass spectrometry pose challenges in computational mathematics and statistics to process the mass spectral data into predictive models...
152
Voted
ENTCS
2007
15 years 4 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...