1502 search results - page 196 / 301 » Node weighted scheduling |
BMCBI
2010
13 years 10 months ago
2010
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
SASO
2008
IEEE
14 years 4 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...
BROADNETS
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract—To reap the benefits of advances in wireless technologies as well as provide backward compatibility with current investments, future wireless routers that constitute th...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
—Burst loss and delay are two main issues in optical hop-count. Network diameter is the hop-count of the shortest burst switching (OBS) networks. In OBS, if the hop-count path be...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...