3958 search results - page 92 / 792 » Dynamic Graph Algorithms with Applications |
132
click to vote
ERSA
2006
2006
GifT: A Gravity-Directed and Life-Time Based Algorithm for Temporal Partitioning of Data Flow Graphs
15 years 6 months ago
In reconfigurable systems, reconfiguration latency has a significant impact on the system performance. In this work, a temporal partitioning algorithm is presented to partition da...
158
click to vote
JGAA
2000
15 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
174
click to vote
TPDS
1998
15 years 4 months ago
1998
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
160
Voted
ISCAPDCS
2007
15 years 6 months ago
2007
The coverage problem is of great interest for many sensor network applications, for example, detection of intruders in the sensor field. Topological changes in sensor networks ma...
133
Voted
ICCAD
1999
IEEE
15 years 9 months ago
1999
IEEE
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...