Sciweavers

708 search results - page 95 / 142
» Timing closure: the solution and its problems
Sort
View
JSSPP
2004
Springer
15 years 3 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,...
FGCS
2008
102views more  FGCS 2008»
14 years 10 months ago
Making the best of a bad situation: Prioritized storage management in GEMS
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...
Justin M. Wozniak, Paul Brenner, Douglas Thain, Aa...
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 10 months ago
Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
Brieuc Conan-Guez, Fabrice Rossi, Aïcha El Go...
TITB
2008
152views more  TITB 2008»
14 years 10 months ago
Region of Interest and Multiresolution for Volume Rendering
Medical image interpretation is facing an important challenge resulting from the continuously increasing amount of imaging data. Innovations in medical image visualization are nece...
Sébastien Piccand, Rita Noumeir, Eric Paque...
DM
1998
68views more  DM 1998»
14 years 9 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin