Sciweavers

4679 search results - page 651 / 936
» The Timely Computing Base Model and Architecture
Sort
View
JSSPP
2004
Springer
15 years 12 months ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
EDBTW
2010
Springer
15 years 11 months ago
Declarative scheduling in highly scalable systems
In modern architectures based on Web Services or Cloud Computing, a very large number of user requests arrive concurrently and has to be scheduled for execution constrained by cor...
Christian Tilgner
ICCV
2003
IEEE
16 years 8 months ago
Tracking Articulated Body by Dynamic Markov Network
A new method for visual tracking of articulated objects is presented. Analyzing articulated motion is challenging because the dimensionality increase potentially demands tremendou...
Ying Wu, Gang Hua, Ting Yu
TOG
2012
246views Communications» more  TOG 2012»
13 years 9 months ago
Continuous penalty forces
We present a simple algorithm to compute continuous penalty forces to determine collision response between rigid and deformable models bounded by triangle meshes. Our algorithm co...
Min Tang, Dinesh Manocha, Miguel A. Otaduy, Ruofen...
CCGRID
2008
IEEE
15 years 8 months ago
Using Probabilistic Characterization to Reduce Runtime Faults in HPC Systems
Abstract--The current trend in high performance computing is to aggregate ever larger numbers of processing and interconnection elements in order to achieve desired levels of compu...
Jim M. Brandt, Bert J. Debusschere, Ann C. Gentile...