1578 search results - page 41 / 316 » Direct Routing: Algorithms and Complexity |
133
Voted
EUROCRYPT
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
ISAAC
2001
Springer
15 years 7 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
110
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
119
Voted
ICNP
2009
IEEE
15 years 9 months ago
2009
IEEE
—Routing protocols are implemented in the form of software running on a general-purpose microprocessor. However, conventional software-based router architectures face significan...
122
click to vote
ISCA
2009
IEEE
15 years 9 months ago
2009
IEEE
Buffers in on-chip networks consume significant energy, occupy chip area, and increase design complexity. In this paper, we make a case for a new approach to designing on-chip in...