3192 search results - page 395 / 639 » The minimum latency problem |
157
click to vote
JSW
2008
15 years 4 months ago
2008
Establishing and accessing a reliable communication infrastructure at crisis site is a challenging research problem. Failure in communication infrastructure and information exchang...
153
click to vote
NETWORKS
2008
15 years 4 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
107
Voted
NPL
2008
15 years 4 months ago
2008
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...
152
click to vote
JCO
2007
15 years 4 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
141
Voted
JCO
2007
15 years 4 months ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...