Sciweavers

603 search results - page 60 / 121
» Advances in constrained clustering
Sort
View
CASES
2003
ACM
14 years 3 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
BMCBI
2007
126views more  BMCBI 2007»
13 years 10 months ago
Using gene expression data and network topology to detect substantial pathways, clusters and switches during oxygen deprivation
Background: Biochemical investigations over the last decades have elucidated an increasingly complete image of the cellular metabolism. To derive a systems view for the regulation...
Gunnar Schramm, Marc Zapatka, Roland Eils, Rainer ...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 10 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
SC
2000
ACM
14 years 2 months ago
Performance of Hybrid Message-Passing and Shared-Memory Parallelism for Discrete Element Modeling
The current trend in HPC hardware is towards clusters of shared-memory (SMP) compute nodes. For applications developers the major question is how best to program these SMP cluster...
D. S. Henty
IPPS
2006
IEEE
14 years 4 months ago
Compiler and runtime support for predictive control of power and cooling
The low cost of clusters built using commodity components has made it possible for many more users to purchase their own supercomputer. However, even modest-sized clusters make si...
Henry G. Dietz, William R. Dieter