Sciweavers

2474 search results - page 65 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
115
Voted
IPPS
2007
IEEE
15 years 8 months ago
Automatic Performance Diagnosis of Parallel Computations with Compositional Models
Performance tuning involves a diagnostic process to locate and explain sources of program inefficiency. A performance diagnosis system can leverage knowledge of performance cause...
Li Li, Allen D. Malony
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 2 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
BMCBI
2008
108views more  BMCBI 2008»
15 years 2 months ago
SPRINT: A new parallel framework for R
Background: Microarray analysis allows the simultaneous measurement of thousands to millions of genes or sequences across tens to thousands of different samples. The analysis of t...
Jon Hill, Matthew Hambley, Thorsten Forster, Murie...
137
Voted
ASP
2005
Springer
15 years 8 months ago
A Preliminary Report on Integrating of Answer Set and Constraint Solving
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
CORR
2002
Springer
133views Education» more  CORR 2002»
15 years 2 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Neal E. Young