Sciweavers

24 search results - page 1 / 5
» Speeding up Parallel Graph Coloring
Sort
View
PARA
2004
Springer
13 years 9 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
CPAIOR
2008
Springer
13 years 6 months ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...
IPPS
2006
IEEE
13 years 10 months ago
Speeding up NGB with distributed file streaming framework
Grid computing provides a very rich environment for scientific calculations. In addition to the challenges it provides, it also offers new opportunities for optimization. In this ...
Bingchen Li, Kang Chen, Zhiteng Huang, H. L. Rajic...
EUROPAR
2005
Springer
13 years 10 months ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
Erik G. Boman, Doruk Bozdag, Ümit V. Ç...
DICTA
2003
13 years 5 months ago
Image Indexing Technique and Its Parallel Retrieval on PVM
  The  paper  presents  the  technique  for  image  indexing  and  its  parallel implementation on a parallel virtual machine. The indexing method is  the  c...
Wichian Premchaiswadi, Nucharee Premchaiswadi, Tei...