20197 search results - page 3659 / 4040 » Comparing Computational Power |
143
click to vote
RTS
2011
14 years 11 months ago
2011
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
168
click to vote
SIMPRA
2011
14 years 11 months ago
2011
In this paper we present a GPU-based multigrid approach for simulating elastic deformable objects in real time. Our method is based on a finite element discretization of the defo...
227
click to vote
SJ
2011
14 years 11 months ago
2011
—In this paper, we study the resilience of supply networks against disruptions and provide insights to supply chain managers on how to construct a resilient supply network from t...
145
click to vote
TASLP
2011
14 years 11 months ago
2011
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
148
click to vote
TVCG
2011
14 years 11 months ago
2011
—In this paper, we present the results of a human computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small mu...