1596 search results - page 22 / 320 » Human-Guided Simple Search |
240
Voted
SAC
2012
ACM
13 years 11 months ago
2012
ACM
In this paper, we present the use of Markov Chain Monte Carlo (MCMC) methods to attack the classical ciphers. We use frequency analysis as our basic tool. First we investigate the...
164
Voted
DLOG
2009
15 years 1 months ago
2009
I will provide an overview of many of the use cases that we looked at to apply OWL ABox reasoning in the real world. The fields we covered included (a) healthcare, and life science...
123
Voted
NICSO
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
123
Voted
AIIA
2009
Springer
15 years 10 months ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
109
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability