314 search results - page 44 / 63 » Complete Problems for Dynamic Complexity Classes |
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...
197
Voted
ASPLOS
2006
ACM
16 years 3 days ago
2006
ACM
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
201
click to vote
KR
1992
Springer
15 years 10 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
166
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
154
Voted
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....