465 search results - page 71 / 93 » On the Hardness of Range Assignment Problems |
102
click to vote
P2P
2005
IEEE
15 years 5 months ago
2005
IEEE
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
111
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
166
Voted
SIGMOD
2008
ACM
16 years 1 days ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
127
click to vote
WSDM
2010
ACM
15 years 9 months ago
2010
ACM
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
EUROSYS
2006
ACM
15 years 9 months ago
2006
ACM
Distributed systems are hard to build, profile, debug, and test. Monitoring a distributed system – to detect and analyze bugs, test for regressions, identify fault-tolerance pr...