1830 search results - page 347 / 366 » Optimizing Sorting with Genetic Algorithms |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
88
Voted
POPL
2010
ACM
15 years 7 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
105
click to vote
COCO
2004
Springer
15 years 1 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
COCO
2003
Springer
15 years 2 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
100
click to vote
ECAL
1995
Springer
15 years 1 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...