1059 search results - page 1 / 212 » Improved Algorithms via Approximations of Probability Distri... |
JCSS
2000
14 years 5 months ago
2000
COCO
2009
Springer
15 years 14 days ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
ICC
2008
IEEE
15 years 10 days ago
2008
IEEE
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
IROS
2007
IEEE
15 years 6 days 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...
AUSAI
2004
Springer
14 years 11 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...