Sciweavers

1542 search results - page 166 / 309
» A Qos Routing Algorithm Based on Ant Algorithm
Sort
View
SPAA
2006
ACM
15 years 9 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
ETFA
2005
IEEE
15 years 9 months ago
A real-time task model based on ideal instant
In many digital control applications, data acquisition and process control are time-critical actions, assumed to be instantaneous and strictly periodic. However, aspects related t...
F. R. de la Rocha, R. S. de Oliveira
FPL
2003
Springer
76views Hardware» more  FPL 2003»
15 years 8 months ago
Quark Routing
With inherent problem complexity, ever increasing instance size and ever decreasing layout area, there is need in physical design for improved heuristics and algorithms. In this in...
Sean T. McCulloch, James P. Cohoon
135
Voted
PDCAT
2005
Springer
15 years 9 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
ANCS
2009
ACM
15 years 1 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin