This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Our novel Call Admission Control (CAC) scheme [1], [2] determines the number of Expedited Forwarding (EF) (Premium) flows accepted, based on e2e available bandwidth measurement. Ho...