14165 search results - page 181 / 2833 » The generalized two-server problem |
136
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
160
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
149
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
124
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
154
click to vote
IPL
2007
15 years 4 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...