Sciweavers

4514 search results - page 451 / 903
» Distributed Optimization in Adaptive Networks
Sort
View
IPPS
1998
IEEE
15 years 9 months ago
Using the BSP Cost Model to Optimise Parallel Neural Network Training
We derive cost formulae for three di erent parallelisation techniques for training supervised networks. These formulae are parameterised by properties of the target computer archit...
R. O. Rogers, David B. Skillicorn
143
Voted
ICASSP
2010
IEEE
15 years 5 months ago
Improved Internet traffic analysis via optimized sampling
Applications to evaluate Internet quality-of-service and increase network security are essential to maintaining reliability and high performance in computer networks. These applic...
Sean McPherson, Antonio Ortega
CLUSTER
2008
IEEE
15 years 11 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
EUROPAR
2004
Springer
15 years 10 months ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...
TPDS
1998
118views more  TPDS 1998»
15 years 4 months ago
Optimizing Computing Costs Using Divisible Load Analysis
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
Jeeho Sohn, Thomas G. Robertazzi, Serge Luryi