Sciweavers

2612 search results - page 66 / 523
» Switching Graphs and Their Complexity
Sort
View
APAL
2008
92views more  APAL 2008»
13 years 10 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John
MST
2011
207views Hardware» more  MST 2011»
13 years 4 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
ICC
2007
IEEE
14 years 4 months ago
LOOFA-PB: A Modified LOOFA Scheduler for Variable-Length Packet Switching
—The LOOFA algorithm is a cell-based scheduler for CIOQ crossbar switches that can guarantee the work-conserving property in a cell-based switch if the crossbar switch works twic...
Afshin Shiravi, Paul S. Min
RTAS
2007
IEEE
14 years 4 months ago
Full Duplex Switched Ethernet for Next Generation "1553B"-Based Applications
Over the last thirty years, the MIL-STD 1553B data bus has been used in many embedded systems, like aircrafts, ships, missiles and satellites. However, the increasing number and c...
Ahlem Mifdaoui, Fabrice Frances, Christian Fraboul
ANCS
2008
ACM
13 years 12 months ago
Packet prediction for speculative cut-through switching
The amount of intelligent packet processing in an Ethernet switch continues to grow, in order to support of embedded applications such as network security, load balancing and qual...
Paul Congdon, Matthew Farrens, Prasant Mohapatra