Sciweavers

1017 search results - page 94 / 204
» A routing algorithm for flip-chip design
Sort
View
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 9 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
PERVASIVE
2008
Springer
13 years 9 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
ASAP
2006
IEEE
147views Hardware» more  ASAP 2006»
13 years 11 months ago
Reconfigurable Shuffle Network Design in LDPC Decoders
Several semi-parallel decoding architectures have been explored by researchers for the quasi-cyclic low density parity check (LDPC) codes. In these architectures, the reconfigurab...
Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy
OOPSLA
2010
Springer
13 years 7 months ago
G-Finder: routing programming questions closer to the experts
Programming forums are becoming the primary tools for programmers to find answers for their programming problems. Our empirical study of popular programming forums shows that the...
Wei Li, Charles Zhang, Songlin Hu
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...