In our previous work, a Multi-Path Routing (MPR) scheme was proposed to maximize the data throughput for torus-based NoCs by utilizing multiple paths for concurrent data transmiss...
Yaoting Jiao, Mei Yang, Yingtao Jiang, Yulu Yang, ...
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
I-Lun Tseng, Huan-Wen Chen, Che-I Lee, Adam Postul...
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...