In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
Andrea C. Arpaci-Dusseau, David E. Culler, Alan M....
— Three new adaptive equalization algorithms for wireless systems operating over frequency selective MIMO channels are proposed. The problem of the MIMO DFE design is formulated ...
Vassilis Kekatos, Aris S. Lalos, Kostas Berberidis
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
Many distributed multimedia applications have the ability to adapt to uctuations in the network conditions. By adjusting temporal and spatial quality to available bandwidth, or man...