2084 search results - page 103 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
126
Voted
IPL
2002
15 years 2 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
128
Voted
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
132
click to vote
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
103
Voted
AAAI
1998
15 years 3 months ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
121
click to vote
ECCC
2010
15 years 2 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...