Sciweavers

4372 search results - page 286 / 875
» Algorithmic Theories of Everything
Sort
View
ICAART
2010
INSTICC
16 years 3 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
150
Voted
ICASSP
2009
IEEE
16 years 24 days ago
On robustness of coupled adaptive filters
We provide a time domain analysis of the robustness and stability performance for coupled adaptive algorithms of gradient type. The considered coupling may occur inherently as wel...
Robert Dallinger, Marjus Rupp
IROS
2009
IEEE
126views Robotics» more  IROS 2009»
16 years 21 days ago
Stability of haptic obstacle avoidance and force interaction
— Stability problems associated with haptics and robot control with obstacle avoidance are analyzed. Obstacle avoidance algorithms are revised to accomplish stable redesign using...
Rolf Johansson, Magnus Annerstedt, Anders Robertss...
ALDT
2009
Springer
110views Algorithms» more  ALDT 2009»
16 years 20 days ago
Manipulating Tournaments in Cup and Round Robin Competitions
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the ...
Tyrel Russell, Toby Walsh
ALDT
2009
Springer
207views Algorithms» more  ALDT 2009»
16 years 20 days ago
Anytime Self-play Learning to Satisfy Functional Optimality Criteria
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
Andriy Burkov, Brahim Chaib-draa