2905 search results - page 402 / 581 » Formal Memetic Algorithms |
115
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
163
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
138
click to vote
IJON
2006
15 years 4 months ago
2006
Ensembles of learning machines have been formally and empirically shown to outperform (generalise better than) single predictors in many cases. Evidence suggests that ensembles ge...
145
click to vote
JCP
2008
15 years 4 months ago
2008
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the ...
144
click to vote
ECCC
2007
15 years 4 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...