Sciweavers

1754 search results - page 13 / 351
» The Computational Complexity of Delay Management
Sort
View
ICSOFT
2008
14 years 11 months ago
An Architecture for Non Functional Properties Management in Distributed Computing
One of the primary benefits of Service Oriented Architecture (SOA) [1] is the ability to compose applications, processes or more complex services from other services. As the comple...
Pierre de Leusse, Panos Periorellis, Theodosis Dim...
IPL
2011
91views more  IPL 2011»
14 years 1 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
BROADNETS
2004
IEEE
15 years 1 months ago
Power Efficient Broadcast Scheduling with Delay Deadlines
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
Dinesh Rajan, Ashutosh Sabharwal, Behnaam Aazhang
PODS
2007
ACM
196views Database» more  PODS 2007»
15 years 9 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
CHIMIT
2009
ACM
15 years 4 months ago
Scripting practices in complex systems management
System administrators are end-users too. And as end-users, they develop tools, create web pages, write command-line scripts, use spreadsheets, and repurpose existing tools. In sho...
Eser Kandogan, Paul P. Maglio, Eben M. Haber, John...