4940 search results - page 546 / 988 » On the Complexity of Universal Programs |
250
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
We propose to demonstrate SGL, a language and system for writing computer games using data management techniques. We will demonstrate a complete game built using the system, and s...
167
click to vote
DBPL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
183
Voted
TASE
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
183
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
183
click to vote
CONCUR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...