15033 search results - page 2773 / 3007 » Complexity Theory and Algorithms |
163
click to vote
FORTE
1997
15 years 6 months ago
1997
Distributed programming and object-oriented programming are two popular programming paradigms. The former is driven by advances in networking technology whereas the latter provide...
151
click to vote
WSC
1997
15 years 6 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...
190
click to vote
NIPS
1993
15 years 6 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...
166
Voted
ATAL
2008
Springer
15 years 6 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...
149
click to vote
ATAL
2010
Springer
15 years 6 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...