1089 search results - page 164 / 218 » Bounds on generalized Frobenius numbers |
STACS
2007
Springer
14 years 3 months ago
2007
Springer
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
ISESE
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider empirical evaluation of the availability of the deployed software. Evaluation of real systems is more realistic, more accurate, and provides higher level of confidenc...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
ADHOCNOW
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...