Sciweavers

3142 search results - page 465 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
ATAL
2005
Springer
15 years 8 months ago
Coordinated exploration in multi-agent reinforcement learning: an application to load-balancing
This paper is concerned with how multi-agent reinforcement learning algorithms can practically be applied to real-life problems. Recently, a new coordinated multi-agent exploratio...
Katja Verbeeck, Ann Nowé, Karl Tuyls
HIPC
2003
Springer
15 years 8 months ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
ATAL
2006
Springer
15 years 6 months ago
Agent interaction in distributed POMDPs and its implications on complexity
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
Jiaying Shen, Raphen Becker, Victor R. Lesser
AUTOMATICA
2006
119views more  AUTOMATICA 2006»
15 years 3 months ago
Absolute stability of third-order systems: A numerical algorithm
The problem of absolute stability is one of the oldest open problems in the theory of control. Even for the particular case of second-order systems a complete solution was present...
Michael Margaliot, Christos Yfoulis
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 4 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets