Sciweavers

5153 search results - page 210 / 1031
» Introduction to Randomized Algorithms
Sort
View
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
15 years 1 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
OOPSLA
2010
Springer
15 years 1 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
ALT
2008
Springer
16 years 6 days ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 7 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
BMCBI
2008
101views more  BMCBI 2008»
15 years 3 months ago
Prediction of glycosylation sites using random forests
Background: Post translational modifications (PTMs) occur in the vast majority of proteins and are essential for function. Prediction of the sequence location of PTMs enhances the...
Stephen E. Hamby, Jonathan D. Hirst