Sciweavers

1963 search results - page 246 / 393
» The Maximum Solution Problem on Graphs
Sort
View
119
Voted
IPPS
2010
IEEE
14 years 10 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
105
Voted
JPDC
2007
177views more  JPDC 2007»
15 years 19 days ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
JCB
2006
125views more  JCB 2006»
15 years 21 days ago
Hypothesis Generation in Signaling Networks
Biological signaling networks comprise the chemical processes by which cells detect and respond to changes in their environment. Such networks have been implicated in the regulati...
Derek A. Ruths, Luay Nakhleh, M. Sriram Iyengar, S...
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 6 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
ATMOS
2010
136views Optimization» more  ATMOS 2010»
14 years 11 months ago
An Empirical Analysis of Robustness Concepts for Timetabling
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
Marc Goerigk, Anita Schöbel