Pages that link to "Item:Q1898112"
From MaRDI portal
The following pages link to The complexity of reconfiguring network models (Q1898112):
Displaying 11 items.
- Minimum maximum reconfiguration cost problem (Q279831) (← links)
- A model of reconfiguration in communicating sequential processes (Q918723) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- The lifting model for reconfiguration (Q2498938) (← links)
- COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS (Q3569286) (← links)
- RELATING TWO-DIMENSIONAL RECONFIGURABLE MESHES WITH OPTICALLY PIPELINED BUSES (Q4528762) (← links)
- EFFICIENT SIMULATION OF AN ACYCLIC DIRECTED RECONFIGURABLE MODEL ON AN UNDIRECTED RECONFIGURABLE MODEL (Q4675880) (← links)
- (Q4712671) (← links)
- A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks (Q4838241) (← links)
- Reconfiguration Algorithms for Interconnection Networks (Q5902841) (← links)
- Network reification as a unified approach to represent network adaptation principles within a network (Q6049069) (← links)