937 search results - page 76 / 188 » On the Complexity of Partial Order Properties |
166
click to vote
IJCAI
2003
15 years 7 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
161
click to vote
ALGORITHMICA
2002
15 years 5 months ago
2002
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...
175
click to vote
EUROCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
A variant of Schnorr’s signature scheme called RDSA has been proposed by I. Biehl, J. Buchmann, S. Hamdy and A. Meyer in order to be used in finite abelian groups of unknown ord...
145
click to vote
SOFSEM
2009
Springer
16 years 2 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
164
click to vote
ALDT
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...