7228 search results - page 743 / 1446 » From Algorithmic to Subjective Randomness |
190
click to vote
COMPGEOM
2003
ACM
16 years 21 days ago
2003
ACM
We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteed-quality meshes of domains in which lon...
192
click to vote
FPGA
2003
ACM
16 years 20 days ago
2003
ACM
The routing channels of an FPGA consist of wire segments of various types providing the tradeoff between performance and routability. In the routing architectures of recently dev...
226
click to vote
COMPGEOM
2010
ACM
16 years 16 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
215
click to vote
SIGECOM
2010
ACM
16 years 8 days ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
178
click to vote
GECCO
2010
Springer
16 years 8 days ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...