1445 search results - page 162 / 289 » Uniformly Hard Languages |
144
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
143
click to vote
SIGMETRICS
2003
ACM
15 years 9 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
136
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
115
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
170
Voted
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...