885 search results - page 66 / 177 » An investigation of the performance of various dynamic sched... |
IJFCS
2006
13 years 7 months ago
2006
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—The design of scheduling policies for wireless data systems has been driven by a compromise between the objectives of high overall system throughput and the degree of fairness a...
ATAL
2004
Springer
13 years 11 months ago
2004
Springer
We investigate the application of a low-cost, pervasively distributed network to plan paths for mobile robots in environments with dynamic obstacles. We consider a heterogeneous s...
SIPS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we investigate the efficient software implementations of the Montgomery modular multiplication algorithm on a multi-core system. A HW/SW co-design technique is use...
HICSS
2003
IEEE
14 years 29 days ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...