258 search results - page 3 / 52 » New Lower Bounds for Heilbronn Numbers |
DCG
1999
13 years 5 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
ECCC
2011
13 years 8 days ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
RECOMB
2005
Springer
14 years 5 months ago
2005
Springer
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
PAKDD
2009
ACM
13 years 9 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...