Sciweavers

2612 search results - page 6 / 523
» Switching Graphs and Their Complexity
Sort
View
80
Voted
INFOCOM
2002
IEEE
15 years 2 months ago
Maintaining Packet Order In Two-stage Switches
-- High performance packet switches frequently use a centralized scheduler (also known as an arbiter) to determine the configuration of a non-blocking crossbar. The scheduler often...
Isaac Keslassy, Nick McKeown
80
Voted
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
15 years 4 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
TC
1998
14 years 9 months ago
Regular Sparse Crossbar Concentrators
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
Weiming Guo, A. Yavuz Oruç
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 2 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...
CIMCA
2005
IEEE
15 years 3 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau