4940 search results - page 598 / 988 » On the Complexity of Universal Programs |
166
click to vote
ERSA
2008
15 years 8 months ago
2008
For two decades, reconfigurable computing systems have provided an attractive alternative to fixed hardware solutions. Reconfigurable computing systems have demonstrated the low c...
202
click to vote
IFIP12
2004
15 years 8 months ago
2004
Recent years have seen considerable developments in modeling techniques for automatic fault location in programs. However, much of this research considered the models from a standa...
145
click to vote
PDPTA
2004
15 years 8 months ago
2004
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
190
click to vote
IJCAI
2003
15 years 8 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...
187
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...