Sciweavers

3179 search results - page 574 / 636
» Applications of PCF Theory
Sort
View
138
Voted
SIGSOFT
2009
ACM
15 years 10 months ago
Automatic synthesis of behavior protocols for composable web-services
Web-services are broadly considered as an effective means to achieve interoperability between heterogeneous parties of a business process and offer an open platform for developing...
Antonia Bertolino, Paola Inverardi, Patrizio Pelli...
SPAA
2009
ACM
15 years 10 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...
FOCS
2009
IEEE
15 years 10 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
ICC
2009
IEEE
120views Communications» more  ICC 2009»
15 years 10 months ago
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
Soung Chang Liew, Caihong Kai, Jason Leung, Bill W...
INFOCOM
2009
IEEE
15 years 10 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...