17505 search results - page 3300 / 3501 » Use Cases as Workflows |
167
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
164
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
174
click to vote
OSDI
2006
ACM
16 years 6 months ago
2006
ACM
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
215
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
180
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...