1084 search results - page 140 / 217 » Optimal worm-scanning method using vulnerable-host distribut... |
AMAI
2011
Springer
12 years 9 months ago
2011
Springer
A multi-armed bandit episode consists of n trials, each allowing selection of one of K arms, resulting in payoff from a distribution over [0, 1] associated with that arm. We assum...
CPHYSICS
2006
13 years 9 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
IROS
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— We propose to improve the locomotive performance of humanoid robots by using approximated biped stepping and walking dynamics with reinforcement learning (RL). Although...
SPAA
1990
ACM
14 years 1 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
GECCO
2006
Springer
14 years 21 days ago
2006
Springer
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...