Sciweavers

121 search results - page 2 / 25
» An Efficient Parallel Algorithm for Solving the Knapsack Pro...
Sort
View
CSC
2010
13 years 3 months ago
An Evaluation of Parallel Knapsack Algorithms on Multicore Architectures
Emergence of chip multiprocessor systems has dramatically increased the performance potential of computer systems. Since the amount of exploited parallelism is directly influenced ...
Hammad Rashid, Clara Novoa, Apan Qasem
IPPS
1999
IEEE
13 years 9 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
IOR
2006
93views more  IOR 2006»
13 years 5 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
IPPS
1999
IEEE
13 years 9 months ago
A Performance Model of Speculative Prefetching in Distributed Information Systems
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
13 years 6 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking