230 search results - page 39 / 46 » Time Varying Undirected Graphs |
JDA
2007
14 years 11 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
TMC
2011
14 years 6 months ago
2011
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
FCCM
2002
IEEE
15 years 4 months ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
109
click to vote
IPPS
2010
IEEE
14 years 8 months ago
2010
IEEE
In this study, we consider an environment composed of a heterogeneous cluster of multicore-based machines used to analyze satellite images. The workload involves large data sets, a...
114
click to vote
BCB
2010
14 years 6 months ago
2010
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...