1686 search results - page 14 / 338 » Programs as polygraphs: computability and complexity |
FECS
2010
14 years 7 months ago
2010
In this paper, we present a method to help teach computer architecture (or computer organization) by developing an in class system where the students, themselves, compile high-leve...
111
click to vote
TGC
2010
Springer
14 years 7 months ago
2010
Springer
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
128
click to vote
SIAMCOMP
2010
14 years 8 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
ACL
2009
14 years 7 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
ECBS
1996
IEEE
15 years 1 months ago
1996
IEEE
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...