7228 search results - page 173 / 1446 » From Algorithmic to Subjective Randomness |
138
Voted
COMPGEOM
1994
ACM
15 years 7 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
116
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
179
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
205
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...
187
click to vote
AAAI
2011
14 years 3 months ago
2011
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...