2084 search results - page 168 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
157
Voted
SMA
2010
ACM
15 years 5 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
149
click to vote
TCS
2010
15 years 3 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
155
click to vote
SODA
1992
ACM
15 years 6 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
174
Voted
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
157
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...