8540 search results - page 1410 / 1708 » The Dynamic Servers Problem |
137
click to vote
SIGMETRICS
1998
ACM
15 years 8 months ago
1998
ACM
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
135
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
147
click to vote
CRYPTO
1993
Springer
15 years 8 months ago
1993
Springer
A broadcast encryption scheme allows the sender to securely distribute data to a dynamically changing set of users over an insecure channel. One of the most challenging settings fo...
157
click to vote
DMSN
2007
ACM
15 years 8 months ago
2007
ACM
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be ...
156
click to vote
FASE
2006
Springer
15 years 8 months ago
2006
Springer
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...