Sciweavers

409 search results - page 56 / 82
» Matching Scenarios with Timing Constraints
Sort
View
SPAA
2009
ACM
14 years 3 months ago
Distributed algorithms for QoS load balancing
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...
ICC
2007
IEEE
14 years 3 months ago
Design of Single-Group Multicasting-Beamformers
— For the single-group multicast scenario, where K users are served with the same data by a base station equipped with N antennas, we present two beamforming algorithms which out...
Raphael Hunger, David A. Schmidt, Michael Joham, A...
TON
2002
144views more  TON 2002»
13 years 8 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
VLDB
2005
ACM
140views Database» more  VLDB 2005»
14 years 2 months ago
Loadstar: Load Shedding in Data Stream Mining
In this demo, we show that intelligent load shedding is essential in achieving optimum results in mining data streams under various resource constraints. The Loadstar system intro...
Yun Chi, Haixun Wang, Philip S. Yu
CAISE
2006
Springer
14 years 18 days ago
Loosely-Coupled Process Automation in Medical Environments
Abstract. We discuss a case study for the hospital scenario where workflow model components are distributed across various computers or devices (e.g. mobile phones, PDAs, sensors, ...
Jurate Vysniauskaite