337 search results - page 32 / 68 » Run-Time Methods for Parallelizing Partially Parallel Loops |
SBACPAD
2004
IEEE
13 years 9 months ago
2004
IEEE
Large scale cluster, Peer-to-Peer computing systems and grid computer systems gather thousands of nodes for computing parallel applications. At this scale, it raises the problem o...
CCO
2001
Springer
14 years 1 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
BMCBI
2008
13 years 7 months ago
2008
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
SCN
2010
Springer
13 years 6 months ago
2010
Springer
Exposure of a secret key is a significant threat in practice. As a notion of security against key exposure, Dodis et al. advocated key-insulated security, and proposed concrete k...