1033 search results - page 156 / 207 » Stop the numbers game |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
100
click to vote
IAT
2003
IEEE
15 years 3 months ago
2003
IEEE
A gradient-based method for both symmetric and asymmetric multiagent reinforcement learning is introduced in this paper. Symmetric multiagent reinforcement learning addresses the ...
ESA
2003
Springer
15 years 3 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
STACS
1999
Springer
15 years 2 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...