Sciweavers

1559 search results - page 143 / 312
» Some Group Theory Problems
Sort
View
171
Voted
IAT
2003
IEEE
15 years 10 months ago
Asymmetric Multiagent Reinforcement Learning
A gradient-based method for both symmetric and asymmetric multiagent reinforcement learning is introduced in this paper. Symmetric multiagent reinforcement learning addresses the ...
Ville Könönen
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 8 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...
CATA
2010
15 years 6 months ago
Mixed-criticality Scheduling: Improved Resource-augmentation Results
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different c...
Sanjoy K. Baruah, Haohan Li, Leen Stougie
84
Voted
AUTOMATICA
2006
64views more  AUTOMATICA 2006»
15 years 4 months ago
On stability of second-order quasi-polynomials with a single delay
In this note the stability of a second-order quasi-polynomial with a single delay is studied. Although there is a vast literature on this problem, most available solutions are lim...
Efim Malakhovski, Leonid Mirkin
148
Voted
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 11 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith