Sciweavers

15485 search results - page 368 / 3097
» Computing Optimal Subsets
Sort
View
HPCC
2005
Springer
16 years 8 days ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...
SC
2003
ACM
16 years 2 hour ago
BCS-MPI: A New Approach in the System Software Design for Large-Scale Parallel Computers
Buffered CoScheduled MPI (BCS-MPI) introduces a new approach to design the communication layer for largescale parallel machines. The emphasis of BCS-MPI is on the global coordinat...
Juan Fernández, Eitan Frachtenberg, Fabrizi...
FCCM
2002
IEEE
208views VLSI» more  FCCM 2002»
15 years 11 months ago
The Effects of Datapath Placement and C-Slow Retiming on Three Computational Benchmarks
C-slow retiming (changing a design to support multiple instances of a computation) and datapath-aware placement have long been advocated by members of the FPGA synthesis community...
Nicholas Weaver, John Wawrzynek
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
HAIS
2009
Springer
15 years 11 months ago
A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids
The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In...
Fatos Xhafa, Juan Antonio Gonzalez, Keshav P. Daha...