10608 search results - page 1860 / 2122 » Complexity of O'Hara's Algorithm |
104
click to vote
WSC
1997
15 years 1 months ago
1997
This article discusses implementation issues for the LBATCH and ABATCH batch means procedures of Fishman and Yarberry (1997). Theses procedures dynamically increase the batch size...
135
Voted
NIPS
1993
15 years 1 months ago
1993
The non-linear complexities of neural networks make network solutions difficult to understand. Sanger's contribution analysis is here extended to the analysis of networks aut...
119
Voted
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Multi-issue negotiation protocols represent a promising field since most negotiation problems in the real world involve multiple issues. Our work focuses on negotiation with inte...
112
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
107
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Decentralized reinforcement learning (DRL) has been applied to a number of distributed applications. However, one of the main challenges faced by DRL is its convergence. Previous ...