Sciweavers

2092 search results - page 365 / 419
» A Theory of Non-Deterministic Networks
Sort
View
RTAS
2002
IEEE
15 years 2 months ago
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...
Tarek F. Abdelzaher, Björn Andersson, Jan Jon...
SPAA
2010
ACM
15 years 2 months ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
ICEIS
2000
IEEE
15 years 2 months ago
Syntax-Directed Translation Schemes for Multi-Agent Systems Conversation Modelling
: In modern organisations the monolithic information systems of the past are being gradually replaced by networked systems, enabling distributed computing often based on multi-agen...
Ana L. N. Fred, Joaquim Filipe
ISLPED
1999
ACM
91views Hardware» more  ISLPED 1999»
15 years 2 months ago
Stochastic modeling of a power-managed system: construction and optimization
-- The goal of a dynamic power management policy is to reduce the power consumption of an electronic system by putting system components into different states, each representing ce...
Qinru Qiu, Qing Wu, Massoud Pedram
FOCS
1998
IEEE
15 years 2 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...