Sciweavers

874 search results - page 98 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
ICANN
2005
Springer
14 years 2 months ago
A Neural Network Model for Inter-problem Adaptive Online Time Allocation
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
Matteo Gagliolo, Jürgen Schmidhuber
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 9 months ago
Power Optimal Scheduling for Guaranteed Throughput in Multi-access Fading Channels
Abstract— A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band channels that can...
Prasanna Chaporkar, Kimmo Kansanen, Ralf R. Mü...
EUROPAR
2009
Springer
14 years 26 days ago
Optimal and Near-Optimal Energy-Efficient Broadcasting in Wireless Networks
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
PVM
2010
Springer
13 years 7 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
ICS
2000
Tsinghua U.
14 years 17 days ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy