1806 search results - page 206 / 362 » Randomness and halting probabilities |
118
Voted
WSC
1998
15 years 5 months ago
1998
An important problem in discrete-event stochastic simulation is the selection of the best system from a finite set of alternatives. There are many techniques for ranking and selec...
125
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
141
Voted
AAAI
2010
15 years 4 months ago
2010
Many methods for quantitative structure-activity relationships (QSARs) deliver point estimates only, without quantifying the uncertainty inherent in the prediction. One way to qua...
178
Voted
CDC
2008
IEEE
15 years 3 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
139
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...