365 search results - page 10 / 73 » Reconfigurations in Graphs and Grids |
SODA
2000
ACM
15 years 2 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
109
click to vote
FCCM
2008
IEEE
15 years 1 months ago
2008
IEEE
Communications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overhead...
108
click to vote
DAC
2005
ACM
16 years 2 months ago
2005
ACM
Many reconfigurable architectures offer partial dynamic configurability, but current system-level tools cannot guarantee feasible implementations when exploiting this feature. We ...
ASPDAC
2000
ACM
15 years 4 months ago
2000
ACM
- This paper describes the design and implementation of a reconfigurable synchronized dataflow processor (RSDP). The RSDP can configure its hardware to directly represent dataflow ...
103
click to vote
DM
2000
15 years 1 months ago
2000
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi