Sciweavers

12194 search results - page 2213 / 2439
» Numberings Optimal for Learning
Sort
View
MOBICOM
2003
ACM
15 years 12 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
PLDI
2003
ACM
15 years 12 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 12 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
FPGA
2003
ACM
137views FPGA» more  FPGA 2003»
15 years 12 months ago
Customized regular channel design in FPGAs
FPGAs are one of the essential components in platform-based embedded systems. Such systems are customized and applied only to a limited set of applications. Also some applications...
Elaheh Bozorgzadeh, Majid Sarrafzadeh
GCC
2003
Springer
15 years 12 months ago
Dynamic Data Grid Replication Strategy Based on Internet Hierarchy
Abstract. In data grid, large quantity of data files is produced and data replication is applied to reduce data access time. Efficiently utilizing grid resources becomes important ...
Sang-Min Park, Jai-Hoon Kim, Young-Bae Ko, Won-Sik...
« Prev « First page 2213 / 2439 Last » Next »