Sciweavers

1186 search results - page 228 / 238
» Progressive Modeling
Sort
View
CLUSTER
2004
IEEE
13 years 11 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
CSB
2004
IEEE
135views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Selection of Patient Samples and Genes for Outcome Prediction
Gene expression profiles with clinical outcome data enable monitoring of disease progression and prediction of patient survival at the molecular level. We present a new computatio...
Huiqing Liu, Jinyan Li, Limsoon Wong
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
13 years 11 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
ECAI
2004
Springer
13 years 11 months ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease
ICDCS
1991
IEEE
13 years 11 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste