19700 search results - page 129 / 3940 » DNA-Based Computation Times |
117
click to vote
JCO
2010
14 years 11 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
124
click to vote
ICST
2009
IEEE
14 years 10 months ago
2009
IEEE
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
112
click to vote
PE
2010
Springer
14 years 11 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
128
click to vote
APPROX
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
110
Voted
CAP
2010
14 years 7 months ago
2010
In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed,...