1299 search results - page 167 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
NSDI
2010
14 years 11 months ago
2010
Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving...
ISTCS
1997
Springer
15 years 1 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
AIPS
2003
14 years 11 months ago
2003
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
108
click to vote
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...