Sciweavers

1389 search results - page 99 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
COR
2010
119views more  COR 2010»
14 years 10 months ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh
DAMON
2006
Springer
15 years 1 months ago
Processing-in-memory technology for knowledge discovery algorithms
The goal of this work is to gain insight into whether processingin-memory (PIM) technology can be used to accelerate the performance of link discovery algorithms, which represent ...
Jafar Adibi, Tim Barrett, Spundun Bhatt, Hans Chal...
ICDCS
2008
IEEE
15 years 4 months ago
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
Vijay Anand Reddy, Prateek Mittal, Indranil Gupta
IPPS
2002
IEEE
15 years 2 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
IPPS
2000
IEEE
15 years 2 months ago
Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routin...
Seungjin Park, Jong-Hoon Youn, Bella Bose