2168 search results - page 341 / 434 » Randomized Algorithms and Complexity Theory |
153
click to vote
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
158
click to vote
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
134
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
122
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
240
click to vote
GIS
2005
ACM
16 years 4 months ago
2005
ACM
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...