Sciweavers

2612 search results - page 2 / 523
» Switching Graphs and Their Complexity
Sort
View
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
13 years 10 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
GG
2004
Springer
13 years 11 months ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
CCR
2006
122views more  CCR 2006»
13 years 6 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ISCAS
2005
IEEE
163views Hardware» more  ISCAS 2005»
13 years 12 months ago
A reconfigurable crossbar switch with adaptive bandwidth control for networks-on-chip
— We propose a new crossbar switch structure with adaptive bandwidth control. In a complex SoC design, the proposed crossbar switch efficiently incorporates various IPs with diff...
Donghyun Kim, Kangmin Lee, Se-Joong Lee, Hoi-Jun Y...
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Human Motion Synthesis with Optimization-based Graphs
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
Cheng Ren, Liming Zhao, Alla Safonova