3946 search results - page 579 / 790 » The computational complexity of choice sets |
205
click to vote
AUTONOMICS
2009
ACM
16 years 1 months ago
2009
ACM
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
160
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
161
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
130
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
222
click to vote
SMA
2009
ACM
16 years 1 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...