686 search results - page 113 / 138 » Packing Cycles in Graphs |
ISPD
2000
ACM
15 years 1 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
CCGRID
2010
IEEE
14 years 7 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
CLUSTER
2003
IEEE
15 years 2 months ago
2003
IEEE
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
BMCBI
2007
14 years 9 months ago
2007
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...
SASO
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...